Generating associations rule mining using Apriori and FPGrowth Algorithms
| ||International Journal of Computer Trends and Technology (IJCTT)|| |
|© - April Issue 2013 by IJCTT Journal|
|Volume-4 Issue-4 |
|Year of Publication : 2013|
|Authors :J.Suresh, P.Rushyanth, Ch.Trinath|
J.Suresh, P.Rushyanth, Ch.Trinath"Generating associations rule mining using Apriori and FPGrowth Algorithms"International Journal of Computer Trends and Technology (IJCTT),V4(4):887-892 April Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract: -Mining frequent itemsets from the large transactional database is one of the most challenging problems in data mining. In many real world scenarios, the data is not extracted from single data source but from distributed and heterogeneous ones. The discovered knowledge is expected to better business operations. In data mining methods association rule mining is one of the most popular one. However, mining informative patterns using association rules often results in a very large no of founding patterns, leaving the analyst with the task to go through all the rules and discover interesting ones In this paper we present a generating associations rules using Apriori and FPGrowth algorithms.
 T. Imielinski,R. Agrawal and T. Swami, Mining association rules between sets of items in large databases. In Proc., ACM SIGMOD Conf. On Manag. of Data, pages 207–216, Washington, D.C,1993.
 Craus M., Archip A., A Generalized Parallel Algorithm for Frequent Itemset Mining and Proceedings of the 12th WSEAS International Conference on Computers, Greece ,Heraklion, 2008, pg. 520-523.
 R. Srikant and R. Agrawal, Mining Generalized Association rules, 1999, pg. 407–419.
 Daniel Hunyadi, Improvements of Apriori Algorithms, First International Conference on Modeling and Development of Intelligent Systems – MDIS, October 22-25, 2009, Sibiu, Romania, “Lucian Blaga” University Publishing House.
 R. Srikant and R. Agrawal. Fast algorithms for mining association rules in largest databases. In J.Bocca, C. Zaniolo and M. Jarke, editors, Proc. Int. Conf. on Very Large Data Bases, pages 478–499, Santiago, Chile, 1994.
 Han J., Pei J., Mao R and Yin Y., Mining frequent patterns without candidate generation: A frequent-pattern tree approach, data mining and knowledge discovery, 2003.
 Daniel Hunyadi, Performance comparison of Apriori and FP-Growth algorithms in generating association rules, Proceedings of the European Computing Conference “Lucian Blaga” University Publishing House.
 H. Zhang, Y. Zhao, C. Zhang and L. Cao, “Combined Association Rule Mining,” in Proc. PAKDD, 2008, pp. 1069–1074.
Keywords —heterogeneous data, discovered knowledge, complex data, associations, frequent items, informative patterns.