Foundation for Frequent Pattern Mining Algorithms’ Implementation
 | International Journal of Computer Trends and Technology (IJCTT) |  |
| © - July Issue 2013 by IJCTT Journal | ||
| Volume-4 Issue-7 | ||
| Year of Publication : 2013 | ||
| Authors :Prof. Paresh Tanna, Dr. Yogesh Ghodasara |
Prof. Paresh Tanna, Dr. Yogesh Ghodasara"Foundation for Frequent Pattern Mining Algorithms’ Implementation"International Journal of Computer Trends and Technology (IJCTT),V4(7):2159-2163 July Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract: - As with the development of the IT technologies, the amount of accumulated data is also increasing. Thus the role of data mining comes into picture. Association rule mining becomes one of the significant responsibilities of descriptive technique which can be defined as discovering meaningful patterns from large collection of data. The frequent pattern mining algorithms determine the frequent patterns from a database. Mining frequent itemset is very fundamental part of association rule mining. Many algorithms have been proposed from last many decades including majors are Apriori, Direct Hashing and Pruning, FP-Growth, ECLAT etc. The aim of this study is to analyze the existing techniques for mining frequent patterns and evaluate the performance of them by comparing Apriori and DHP algorithms in terms of candidate generation, database and transaction pruning. This creates a foundation to develop newer algorithm for frequent pattern mining.
References-
[1] Data Mining: Concepts and Techniques, Jiawei Han and Micheline Kamber, MORGAN KAUFMANN PUBLISHER, An Imprint of Elsevier
[2] R. Agrawal and S. Srikant, "Fast Algorithms for Mining Association Rules in Large Databases“, Proceedings of the 20th International Conference on Very Large Data Bases, September 1994.
[3] J. Park, M. Chen and Philip Yu, "An Effective Hash-Based Algorithm for Mining Association Rules", Proceedings of ACM Special Interest Group of Management of Data, ACM SIGMOD’95, 1995.
[4] Han, Pei & Yin, "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach", Data Mining and Knowledge Discovery, Volume 8, Issue 1 , pp 53-87,2004
[5] M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, " New Algorithms for Fast Discovery of Association Rules", Proc. 3rd ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD`97, Newport Beach, CA), 283-296 AAAI Press, Menlo Park, CA, USA 1997
[6] Shruti Aggarwal, Ranveer Kaur, “Comparative Study of Various Improved Versions of Apriori Algorithm”, International Journal of Engineering Trends and Technology (IJCTT) - Volume4Issue4- April 2013
[7] Agrawal, R., T. Imielin´ ski, and A. Swami (1993). Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, SIGMOD ’93, New York, NY, USA, pp. 207–216. ACM.
Keywords : — Association rule, Frequent pattern mining, Apriori, DHP, Foundation Implementation Study.