Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/SpecialIssue.2011.010323
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Special Issue on Artificial Intelligence, 2011.
Abstract: Frequent pattern mining has become an important data mining task and has been a focused theme in data mining research. Frequent patterns are patterns that appear in a data set frequently. Frequent pattern mining searches for recurring relationship in a given data set. Various techniques have been proposed to improve the performance of frequent pattern mining algorithms. This paper presents review of different frequent mining techniques including apriori based algorithms, partition based algorithms, DFS and hybrid algorithms, pattern based algorithms, SQL based algorithms and Incremental apriori based algorithms. A brief description of each technique has been provided. In the last, different frequent pattern mining techniques are compared based on various parameters of importance. Experimental results show that FP- Tree based approach achieves better performance.
Deepak Garg and Hemant Sharma, “Comparative Analysis of Various Approaches Used in Frequent Pattern Mining” International Journal of Advanced Computer Science and Applications(IJACSA), Special Issue on Artificial Intelligence, 2011. http://dx.doi.org/10.14569/SpecialIssue.2011.010323