Partition-based sorted pre-fix tree construction using global list to mine maximal patterns with incremental and interactive mining

Maximal pattern mining in highly dynamic transactional database is difficult task since both discarded and updated contents are used together by changing the threshold. This essence has spurred the researchers to develop algorithm to support both incremental and interactive mining, which do not identify the pattern again and again for a corresponding update in the database. In this paper, a partition-based sorted prefix-tree (PSP-tree) is proposed and is constructed in two phases with single scan. Initially, the sub trees are built along with its item lists and are merged to obtain the global sorted item list. Later, each node of the sub trees is dynamically rearranged based on the sorted list and merged to form the proposed tree to support incremental and interactive mining. Performance of PSP-tree is encouraging especially for sparse database and the patterns are mined very fast compared to recent similar approach.

[1]  Jia-Ling Koh,et al.  An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures1 , 2004, DASFAA.

[2]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

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

[4]  Xindong Wu,et al.  Association analysis with one scan of databases , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

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

[6]  Yue-Shi Lee,et al.  Incremental and interactive mining of web traversal patterns , 2008, Inf. Sci..

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

[8]  Gösta Grahne,et al.  Fast algorithms for frequent itemset mining using FP-trees , 2005, IEEE Transactions on Knowledge and Data Engineering.

[9]  Hongjun Lu,et al.  CFP-tree: A compact disk-based structure for storing and querying frequent itemsets , 2007, Inf. Syst..

[10]  R. S. Thakur,et al.  Maximal Pattern Mining Using Fast CP-Tree for Knowledge Discovery , 2012, Int. J. Inf. Syst. Soc. Chang..

[11]  Suh-Yin Lee,et al.  Interactive sequence discovery by incremental mining , 2004, Inf. Sci..

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

[13]  Anthony J. T. Lee,et al.  An efficient algorithm for mining frequent inter-transaction patterns , 2007, Inf. Sci..

[14]  Young-Koo Lee,et al.  Efficient single-pass frequent pattern mining using a prefix-tree , 2009, Inf. Sci..

[15]  Zhan Li,et al.  Knowledge and Information Systems , 2007 .

[16]  Osmar R. Zaïane,et al.  Incremental mining of frequent patterns without candidate generation or support constraint , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

[17]  Ramesh C Agarwal,et al.  Depth first generation of long patterns , 2000, KDD '00.

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

[19]  Chengqi Zhang,et al.  EDUA: An efficient algorithm for dynamic database mining , 2007, Inf. Sci..

[20]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[21]  Yuh-Jiuan Tsay,et al.  An efficient cluster and decomposition algorithm for mining association rules , 2004, Inf. Sci..

[22]  Xin Li,et al.  A Fast Algorithm for Maintenance of Association Rules in Incremental Databases , 2006, ADMA.

[23]  David Wai-Lok Cheung,et al.  A General Incremental Technique for Maintaining Discovered Association Rules , 1997, DASFAA.

[24]  Jiawei Han,et al.  Frequent pattern mining: current status and future directions , 2007, Data Mining and Knowledge Discovery.

[25]  Fan Wu,et al.  A new approach to mine frequent patterns using item-transformation methods , 2007, Inf. Syst..

[26]  Chia-Hui Chang,et al.  Enhancing SWF for Incremental Association Mining by Itemset Maintenance , 2003, PAKDD.