Adaptive Apriori Algorithm for frequent itemset mining

Obtaining frequent itemsets from the dataset is one of the most promising area of data mining. The Apriori algorithm is one of the most important algorithm for obtaining frequent itemsets from the dataset. But the algorithm fails in terms of time required as well as number of database scans. Hence a new improved version of Apriori is proposed in this paper which is efficient in terms of time required as well as number of database scans than the Apriori algorithm. It is well known that the size of the database for defining candidates has great effect on running time and memory need. We presented experimental results, showing that the proposed algorithm always outperform Apriori. To evaluate the performance of the proposed algorithm, we have tested it on Turkey student's database as well as a real time dataset.

[1]  Qing He,et al.  Parallel Implementation of Apriori Algorithm Based on MapReduce , 2012, 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

[2]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[3]  Philip S. Yu,et al.  Efficient parallel data mining for association rules , 1995, CIKM '95.

[4]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[5]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[6]  Rong Gu,et al.  YAFIM: A Parallel Frequent Itemset Mining Algorithm with Spark , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[7]  Sidney Viana,et al.  Matrix Apriori: Speeding Up the Search for Frequent Patterns , 2006, Databases and Applications.

[8]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

[9]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[10]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[11]  Qing He,et al.  Parallel Implementation of Apriori Algorithm Based on MapReduce , 2012, SNPD.

[12]  Baris Yildiz,et al.  COMPARISON OF TWO ASSOCIATION RULE MINING ALGORITHMS WITHOUT CANDIDATE GENERATION , 2010 .

[13]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[14]  Suhel Hammoud,et al.  MapReduce network enabled algorithms for classification based on association rules , 2011 .

[15]  Ming-Yen Lin,et al.  Apriori-based frequent itemset mining algorithms on MapReduce , 2012, ICUIMC.