A comparative analysis on efficiency of contemporary association rule mining algorithm

A vital procedure that is indispensable in the field of data mining is the association rule mining in which the focus is up on the finding of the curious associations, correlations and frequent item sets amongst the list of items in a given database. There are typically two steps in the algorithms that employ association rules. The first step being the finding of the frequent sets and the second being the usage of these sets in order to generate the association rules. The current paper puts forward an analysis of comparison between the various association rule mining algorithms. Besides, the applications, benefits and the drawbacks have also been studied in the paper. The paper reviews the features, data sets variants, support, confidence, rule generation and candidate generation of the algorithms that are employed to mine the association rules.

[1]  R. J. Kuo,et al.  Application of particle swarm optimization to association rule mining , 2011, Appl. Soft Comput..

[2]  Tarinder Singh,et al.  Sandwich-Apriori: A combine approach of Apriori and Reverse-Apriori , 2015, 2015 Annual IEEE India Conference (INDICON).

[3]  Maybin K. Muyeba,et al.  An algorithm to mine general association rules from tabular data , 2007, Inf. Sci..

[4]  Divakar Singh,et al.  Optimizing network traffic by generating association rules using hybrid apriori-genetic algorithm , 2013, 2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN).

[5]  Li Min,et al.  The Research of FP-Growth Method Based on Apriori Algorithm in MDSS , 2010, 2010 International Conference on Digital Manufacturing & Automation.

[6]  Ming-Syan Chen,et al.  Progressive Partition Miner: An Efficient Algorithm for Mining General Temporal Association Rules , 2003, IEEE Trans. Knowl. Data Eng..

[7]  Weiming Shen,et al.  Incremental FP-Growth mining strategy for dynamic threshold value and database based on MapReduce , 2014, Proceedings of the 2014 IEEE 18th International Conference on Computer Supported Cooperative Work in Design (CSCWD).

[8]  Ming Lei,et al.  A high efficient AprioriTid algorithm for mining association rule , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[9]  Sixue Bai,et al.  An Efficiency apriori Algorithm: P_Matrix Algorithm , 2007, The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007).

[10]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[11]  J LoboL.M.R.,et al.  A Comparative Study of Association Rule Algorithms for Course Recommender System in E-learning , 2012 .

[12]  Xiaoning Peng,et al.  A New Implementation of Recursive Feature Elimination Algorithm for Gene Selection from Microarray Data , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[13]  Soon Myoung Chung,et al.  Mining association rules from relations on a parallel NCR teradata database system , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..