Comparative Study of Revised FP – Growth, Weighted Apriori and Fuzzy Apriori Algorithm
|International Journal of Engineering Trends and Technology (IJETT)||
|© 2014 by IJETT Journal|
|Year of Publication : 2014|
|Authors : A.Arthi Priadharsni , Dr. E. Ramaraj
A.Arthi Priadharsni , Dr. E. Ramaraj. "Comparative Study of Revised FP – Growth, Weighted Apriori and Fuzzy Apriori Algorithm", International Journal of Engineering Trends and Technology (IJETT), V13(6),261-265 July 2014. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
Association Rule Mining is considered as one of the crucial step in finding the frequent Itemsets, for the purpose of extracting association rules from high voluminous relational databases. Many algorithms were developed to find the frequently occurred Itemsets. The association rules were considered as better, since they are useful at the level of decision making. . The main benefit of the Apriori- algorithm is that it doesn’t need to generate conditional patterns Iteratively and adds the pruning step to eliminate the irrelevant data. FP-tree is highly a compact representation of all relevant frequency information in the data set. This paper presents a summarization and a comparative study of the available algorithms namely the Weighted Apriori, Revised FP-growth (Frequent Pattern), Frequent pattern growth and the fuzzy Apriori algorithm with their variations in mining the association rules to get frequent Itemsets.
 Agrawal R, Srikant R., "Fast Algorithms for Mining Association Rules", VLDB. Sep 12-15 1994, Chile, 487-99, ISBN 1-55860-153-8.
 R. Agrawal, Tomasz Imielinski, Arun Swami, "Mining association rules between sets of items in lager databases", in Proceeding of ACM SIGMOD international conference of management of data, Washington, DC, May 1993, 207-216.
 H. Ahonen, O. Heinonen, M. Klemettinen, and A.I. Verkamo,“Applying Data Mining Techniques for Descriptive Phrase Extraction in Digital Document Collections,” Proc. IEEE Int’l Forum on Research and Technology Advances in Digital Libraries(ADL ’98), pp. 2-11, 1998.
 Ankit R Kharwar,Viral Kapadia,Nilesh Prajapati,Premal Patel,"Implementing APRIORI Algorithm on Web serve log",National Conference on Recent Trends in Engineering & Technology,B.V.M. Engineering College, V.V.Nagar,Gujarat,India,13-14 May 2011.
 Han J., Pei J., Yin Y. and Mao R., “Mining frequent patterns without candidate generation: A frequent-pattern tree approach” Data Mining and Knowledge Discovery, 2004.
 Jiawei H, Micheline K, "Data Mining:Concepts and Techniques" Morgan Kaufinann, 1 st edition 2000.
 Lei Wang, Xing-Juan Fan, Xing-Long Lw, Huan Zha0, “Mining Data Association Based On A Revised Fp-Growth Algorithm”, in Proceedings of the 2012 International Conference on Machine Learning and Cybernetics, Xian, 15-17 July, 2012,pp:91-95.
 Ning Zhong, Yuefeng Li, and Sheng-Tang Wu, “Efftective Pattern Discovery for Text Mining”, in IEEE transaction on Knowledge and Data Engineering, Vol 24, No 1, Jan 2012, pp: 30 -43.
 M Suman ,T Anuradha ,K Gowtham, A Ramakrishna, “A Frequent Pattern Mining Algorithm Based On Fp-Tree Structure Andapriori Algorithm”, in International Journal of Engineering Research and Applications, Vol. 2, Issue 1, Jan-Feb 2012, pp.114-116.
 R.Sridevi and Dr.E.Ramaraj, “Finding Frequent Patterns Based On Quantitative Binary Attributes Using FP-Growth Algorithm”, in Int. Journal of Engineering Research and Applications, Vol. 3, Issue 6, Nov-Dec 2013, pp.829-834.
 Xing-Juan Fan, Xing-Long Lw, Huan Zha, “Mining Data Association Based On A Revised Fp-Growth Algorithm”, in Proceedings of the 2012 International Conference on Machine Learning and Cybernetics, Xian, 15-17 July, 2012, pp:91- 95.
Association Rule Discovery, Frequent Pattern Mining, FP-Growth algorithm, Weighted Apriori, Revised Fp- Growth.