An Efficient Incremental Mining Approach Based on IT-Tree

The itemset-tidset-tree (IT-tree) is an efficient data structure for association-rule mining. Zaki et al. designed a mining algorithm based on the IT-tree structure, which traversed an IT-tree in a depth-first order, generated itemsets by using the concept of equivalence classes, and computed the support values of itemsets fast by tidset intersection. It, however, needed to process all transactions in a batch way. In this paper, we propose a Pre-FUIT algorithm (Fast-Update algorithm based on the IT-tree structure and the concept of PRE-large itemsets algorithm), which does not only update the IT-tree when new transactions are inserted, but also mine all frequent itemsets easily. Experimental results show the good performance of the proposed algorithm.

[1]  Lajos Rónyai,et al.  Trie: An alternative data structure for data mining algorithms , 2003 .

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

[3]  Tzung-Pei Hong,et al.  Maintenance of fast updated frequent pattern trees for record deletion , 2009, Comput. Stat. Data Anal..

[4]  Mohammed J. Zaki.  Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

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

[6]  D. Cheung,et al.  Maintenance of Discovered Association Rules , 2002 .

[7]  Tzung-Pei Hong,et al.  Incrementally fast updated frequent pattern trees , 2008, Expert Syst. Appl..

[8]  Tzung-Pei Hong,et al.  An efficient and effective association-rule maintenance algorithm for record modification , 2010, Expert Syst. Appl..

[9]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[10]  Tzung-Pei Hong,et al.  A new incremental data mining algorithm using pre-large itemsets , 2001, Intell. Data Anal..

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

[12]  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.

[13]  Mohammed J. Zaki,et al.  Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.

[14]  Tzung-Pei Hong,et al.  The Pre-FUFP algorithm for incremental mining , 2009, Expert Syst. Appl..

[15]  David Thomas,et al.  The Art in Computer Programming , 2001 .