Open Access Open Access  Restricted Access Subscription or Fee Access

Comparative Analysis of Frequent Pattern Mining Algorithms

Shivangi Srivastava


As IT technologies are getting advance, the numbers of data accumulated is also enhancing very frequently. Hence the role of data mining comes into the picture. The first algorithm proposed in this approach is Apriori Algorithm. With the time several algorithms have come up during the past several years which includes Apriori, Relim, Direct Hashing and Pruning, ECLAT etc..


Frequent Pattern Mining, Apriori, Relim, Direct Hashing and Pruning

Full Text:



Data Mining: Concepts and Techniques, Jiawei Han and Micheline Kamber, MORGAN KAUFMANN PUBLISHER, An Imprint of Elsevier.

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.

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.

Prof. Paresh Tanna, Dr. Yogesh Ghodasara. “Foundation for Frequent Pattern Mining Algorithms’ Implementation”. International Journal of Computer Trends and Technology, Volume 4 Issue 7, July 2013.

Christian Borgelt. “Finding Frequent Item Sets by Recursive Elimination”. Department of Knowledge Processing and Language Engineering

Shruti Aggarwal, Ranveer Kaur, “Comparative Study of Various Improved Versions of Apriori Algorithm”, International Journal of Engineering Trends and Technology (IJETT) - Volume4Issue4- April 2013.

Pramod S. and O.P. Vyas. “Survey on Frequent Itemset Mining Algorithms”. International Journal of Computer Applications, pages 94-100.

Goswami D.N, Chaturvedi Anshu. Raghuvanshi C.S. “An Algorithm for Frequent Pattern Mining Based On Apriori”. Goswami D.N. et. al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 04, 2010, 942-947.

Sunil Joshi, R S Jadon and R C Jain. “A framework for Frequent Pattern Mining Using Dynamic Function”, International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011

Vikas Kumar, Sangita Satapathy. “A Review on Algorithms for Mining Frequent Itemset Over Data Stream” International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, April 2013, pages 917-919.

Deepak Garg, Hemant Sharma. “Comparitive Analysis of Various Approaches Used in Frequent Pattern Mining” International Journal of Advanced Computer Science and Applications, pages 41-47.

Jiawei Han, Hong Cheng, Dong Xin, Xiefeng Yan, “Frequent Pattern Mining: current status and future directions”, Springer Science+Business Media, LLC 2007.

Mahmood Deypir, M Sadreddini, & S Hashemi. “ Towrds a variable size sliding window model for frequent itemset mining over data streams” Elsevier (2012).

Han Jiawei, Pei Jian, and Yin Yiwen. “Mining Frequent Patterns without Candidate Generation”. SIGMOD, 1-12, Dallas, TX, May 2000.

C. Borgelt. Efficient Implementations of Apriori and Eclat. Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL). CEUR Workshop Proceedings 90, Aachen, Germany 2003.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.