Open Access Open Access  Restricted Access Subscription or Fee Access

A Survey on Techniques of Frequent Pattern Mining

Sagar Gajera, Narendrasinh Limbad, Manmay Badheka


In Functions of Data Mining, Frequent Pattern mining algorithms are challenging for real time applications like market basket analysis, sales analysis etc. However, frequent pattern mining is based on occurrences of any item set into the database or data repositories. A-priori and FP-Tree are the most basic algorithms for mining frequent patterns. There are other methods developed from these two methods to make the procedure efficient and to overcome the disadvantages of basic algorithms. The advantages of these methods can be visualized using some attributes like efficiency, space efficiency, lower database scan, simplicity etc. Also, Comparison of these methods with each other, the disadvantages can be extracted.


Association Rule Mining, Frequent Pattern Mining, Frequent Itemset, A-Priori Algorithm

Full Text:



Bhalodiya, Dharmesh, K. M. Patel, and Chhaya Patel. "An efficient way to find frequent pattern with dynamic programming approach." Engineering (NUiCONE), 2013 Nirma University International Conference on. IEEE, 2013.

Kazi Mahbub Mutakabbir, Shah S Mahin, Md. Abid Hasan, “Mining Frequent Pattern within a Genetic Sequence Using Unique Pattern Indexing and Mapping Techniques”, 3rd International Conference On Informatics, Electronics & Vision, IEEE, 2014.

Ashika Gupta, Rakhiarora, Ranjana sikarwar, Neha Saxena, “Web Usage Mining Using Improved Frequent Pattern Tree Algorithms”, Issues and Challenges in Intelligent Computing Techniques (ICICT), IEEE, 2014.

Zhang, Zhongnan, Weili Wu, and Yaochun Huang. "Mining dynamic interdimension association rules for local-scale weather prediction." Computer Software and Applications Conference, 2004. COMPSAC 2004. Proceedings of the 28th Annual International. Vol. 2. IEEE, 2004.

Aggarwal, Shruti, and Ranveer Kaur. "Comparative Study of Various Improved Versions of Apriori Algorithm." proceeding of IJETT 4.4 (2013).

Bhowmik, Biswajit. "Dynamic Programming–Its Principles, Applications, Strengths, and Limitations." criterion 4 IJEST (2010): 7.

T. H. Corman, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to Algorithms”, Third Edition, MIT Press, Cambridge, London, 2009.

Han Jiawei, and Micheline Kamber. Data Mining Concepts and Techniques, Southeast Asia Edition. Morgan kaufmann Publisher, 2006. ISBN 1-55860-901-6.

Harimohan Pande, “Design Analysis and Algorithm”, Firewall Media Publication, 2008.

“What is Data Mining? Definition and Meaning”, [Online] Available: (November 2, 2014 02:45 pm).

Akannsha A. Totewar, “Data Mining: Concepts and Techniques Slides”, [Online] Available: (November 2, 2014 02:45 pm).

“Frequent Pattern Mining | Data Mining Articles”, [Online] Available: (November 2, 2014 02:45 pm).

“Association Rules Algorithms | Data Mining Articles”, [Online] Available: (November 2, 2014 02:45 pm).

“Tutorial for Dynamic Programming | Codechef”, [Online] Available: (November 2, 2014 02:45 pm).

“Dynamic Programming Practice Problems”, [Online] Available: (November 2, 2014 02:45 pm).


  • There are currently no refbacks.

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