Mining Association Rules in Large Database by Implementing Pipelining Technique in Partition Algorithm

Mining for association rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an efficient algorithm for mining association rules that is faster than the previously proposed partition algorithms approximately m times where m is the number of stages in pipeline. The algorithm is also ideally suited for parallelization. General Terms Database, Data Mining, Algorithms

[1]  Ladda Preechaveerakul,et al.  FIAST: A Novel Algorithm for Mining Frequent Itemsets , 2009, 2009 International Conference on Future Computer and Communication.

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

[3]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[4]  Jun Gao.  An New Algorithm of Association Rule Mining , 2008, 2008 International Conference on Computational Intelligence and Security.

[5]  Liu Hong-min.  Study and Implementation of Association Rule Algorithm in Data Mining , 2009, 2009 International Conference on Signal Processing Systems.

[6]  Dimitris Kanellopoulos,et al.  Association Rules Mining: A Recent Overview , 2006 .

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

[8]  Ming-Syan Chen,et al.  Hardware-Enhanced Association Rule Mining with Hashing and Pipelining , 2008, IEEE Transactions on Knowledge and Data Engineering.

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

[10]  T. H. Meyer.  Computer Architecture and Organization , 1982 .

[11]  Defu Zhang,et al.  A New Algorithm for Frequent Itemsets Mining Based on Apriori and FP-Tree , 2009, 2009 WRI Global Congress on Intelligent Systems.

[12]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..