Performance Analysis of Apriori Algorithm with Progressive Approach for Mining Data

The Data Mining refers to extract or mine knowledge from huge volume of data. Association Rule mining is the technique for knowledge discovery. It is a well-known method for discovering correlations between variables in large databases. One of the most famous association rule learning algorithm is Apriori. The Apriori algorithm is based upon candidate set generation and test method. The problem that always appears during mining frequent relations is its exponential complexity. In this paper, we propose a new algorithm named progressive APRIORI (PAPRIORI) that will work rapidly`. This algorithm generates frequent itemsets by means of reading a particular set of transactions at a time while the size of original database is known.

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

[2]  Runtong Zhang,et al.  A New Frame of Knowledge Discovery , 2008, First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008).

[3]  Worapoj Kreesuradej,et al.  Mining Dynamic Databases using Probability-Based Incremental Association Rule Discovery Algorithm , 2009, J. Univers. Comput. Sci..

[4]  Nittaya Kerdprasop,et al.  Mining Frequent Patterns with Functional Programming , 2007 .

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

[6]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[7]  R. Amornchewin,et al.  Incremental association rule mining using promising frequent itemset algorithm , 2007, 2007 6th International Conference on Information, Communications & Signal Processing.

[8]  Jiawei Han,et al.  Maintenance of discovered association rules in large databases: an incremental updating technique , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[9]  Paul Gray,et al.  Introduction to Data Mining and Knowledge Discovery , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[10]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.