A Decomposition Approach for Mining Frequent Itemsets

In this paper, instead of proposing the fastest mining algorithm in the world, we present a new approach in mining association rules. We propose a new algorithm - GRA (Gradational Reduction Approach). It adopts three mechanisms to increase the performance of mining. First, GRA algorithm uses a hash based technique, Hash MAP, which is similar to Hash Table to increase the access efficiency. Second, GRA algorithm uses an infrequent itemsets filtering mechanism to avoid generating a great deal of infrequent sub-itemsets of transaction records. Third, in order to reduce the size of database, GRA algorithm uses gradational reduction mechanism which uses the frequent itemsets as the information of filtration mechanisms to erase the infrequent items from database at every phase. GRA algorithm can decrease a large number of non-frequent itemsets and increase the utility rate of memory.

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

[2]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

[3]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

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

[5]  Geert Wets,et al.  Using association rules for product assortment decisions: a case study , 1999, KDD '99.

[6]  George Karypis,et al.  LPMiner: an algorithm for finding frequent itemsets using length-decreasing support constraint , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[7]  Ke Wang,et al.  Mining frequent item sets by opportunistic projection , 2002, KDD.

[8]  Zvi M. Kedem,et al.  Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set , 2002, IEEE Trans. Knowl. Data Eng..

[9]  Ching-Chi Hsu,et al.  Generating Frequent Patterns with the Frequent Pattern List , 2001, PAKDD.

[10]  Zvi M. Kedem,et al.  Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set , 1998, EDBT.

[11]  Gösta Grahne,et al.  Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[12]  Ron Kohavi,et al.  Real world performance of association rule algorithms , 2001, KDD '01.

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

[14]  Huang-Cheng Kuo,et al.  An efficient incremental mining algorithm-QSD , 2007, Intell. Data Anal..