Cluster based bit vector mining algorithm for finding frequent itemsets in temporal databases

Abstract In this paper, we introduce an efficient algorithm using a new technique to find frequent itemsets from a huge set of itemsets called Cluster based Bit Vectors for Association Rule Mining (CBVAR). In this work, all the items in a transaction are converted into bits (0 or 1). A cluster is created by scanning the database only once. Then frequent 1-itemsets are extracted directly from the cluster table. Moreover, frequent k-itemsets, where k ≥ 2 are obtained by using Logical AND between the items in a cluster table. This approach reduces main memory requirement since it considers only a small cluster at a time and as scalable for any large size of database. The overall performance of this method is significantly better than that of the previously developed algorithms for effective decision making.

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

[2]  Yuh-Jiuan Tsay,et al.  CBAR: an efficient method for mining association rules , 2005, Knowl. Based Syst..

[3]  Keshri Verma,et al.  Efficient calendar based temporal association rule , 2005, SGMD.

[4]  Yungho Leu,et al.  An effective Boolean algorithm for mining association rules in large databases , 1999, Proceedings. 6th International Conference on Advanced Systems for Advanced Applications.

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

[6]  Chaohui Liu,et al.  Fast Mining and Updating Frequent Itemsets , 2008, 2008 ISECS International Colloquium on Computing, Communication, Control, and Management.

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

[8]  Yu Zhao-ping,et al.  Improved Method of Apriori Algorithm Based on Matrix , 2006 .

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

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

[11]  Sridhar Ramaswamy,et al.  Cyclic association rules , 1998, Proceedings 14th International Conference on Data Engineering.

[12]  Chun Zhang,et al.  Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

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

[14]  Nicolás Marín,et al.  TBAR: An efficient method for association rule mining in relational databases , 2001, Data Knowl. Eng..

[15]  Khairuddin Omar,et al.  Scalable and efficient method for mining association rules , 2009, 2009 International Conference on Electrical Engineering and Informatics.