A fast association rule algorithm based on bitmap and granular computing

Mining association rules from databases is a time-consuming process. Finding the large item set fast is the crucial step in the association rule algorithm. In this paper we present a fast association rule algorithm (Bit-AssoRule) based on granular computing. Our Bit-AssocRule doesn't follow the generation-and-test strategy of Apriori algorithm and adopts the divide-and-conquer strategy, thus avoids the time-consuming table scan to rind and prune the itemsets, all the operations of finding large itemsets from the datasets are the fast bit operations based on its corresponding granular. The experimental result of our Bit-AssocRule algorithm with Apriori, AprioriTid and AprioirHybrid algorithms shows Bit-AssocRule is 2 to 3 orders of magnitudes faster. Our research indicates that bitmap and granular computing can greatly improve the performance of association rule algorithm, and are very promising for data mining applications.

[1]  Guizhen Yang,et al.  The complexity of mining maximal frequent itemsets and maximal frequent patterns , 2004, KDD.

[2]  Tsau Young Lin,et al.  Finding Association Rules Using Fast Bit Computation: Machine-Oriented Modeling , 2000, ISMIS.

[3]  Srinivasan Parthasarathy,et al.  New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[4]  Devavrat Shah,et al.  Turbo-charging vertical mining of large databases , 2000, SIGMOD '00.

[5]  Ulrich Güntzer,et al.  Integrating Association Rule Mining Algorithms with Relational Database Systems , 2001, ICEIS.

[6]  Charu C. Aggarwal,et al.  A Tree Projection Algorithm for Generation of Frequent Item Sets , 2001, J. Parallel Distributed Comput..

[7]  Tadeusz Morzy,et al.  Group Bitmap Index: A Structure for Association Rules Retrieval , 1998, KDD.

[8]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

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

[10]  PeiJian,et al.  Mining Frequent Patterns without Candidate Generation , 2000 .

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

[12]  Roberto J. Bayardo,et al.  Mining the most interesting rules , 1999, KDD '99.

[13]  Laks V. S. Lakshmanan,et al.  Mining frequent itemsets with convertible constraints , 2001, Proceedings 17th International Conference on Data Engineering.

[14]  Laks V. S. Lakshmanan,et al.  Exploratory mining via constrained frequent set queries , 1999, SIGMOD '99.

[15]  Tsau Young Lin,et al.  Data Mining and Machine Oriented Modeling: A Granular Computing Approach , 2000, Applied Intelligence.

[16]  Heikki Mannila,et al.  Efficient Algorithms for Discovering Association Rules , 1994, KDD Workshop.

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

[18]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[19]  Hongjun Lu,et al.  H-mine: hyper-structure mining of frequent patterns in large databases , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[20]  Mohammed J. Zaki.  Generating non-redundant association rules , 2000, KDD '00.

[21]  Dimitrios Gunopulos,et al.  Constraint-Based Rule Mining in Large, Dense Databases , 2004, Data Mining and Knowledge Discovery.

[22]  Elisa Bertino,et al.  Indexing Techniques for Advanced Database Systems , 1997, The Springer International Series on Advances in Database Systems.