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.