Fast Determination of Items Support Technique from Enhanced Tree Data Structure

Frequent Pattern Tree (FP-Tree) is one of the famous data structure to keep frequent itemsets. However when the content of transactional database is modified, FP-Tree must be reconstructed again due to the changes in patterns and items support. Until this recent, most of the techniques in frequent pattern mining are using the original database to determine the items support and not from their recommended trees data structure. Therefore in this paper, we proposed a technique called Fast Determination of Item Support Technique (F-DIST) to capture the items support from our suggested Disorder Support Trie Itemset (DOSTrieIT) data structure. Experiments with the UCI datasets show that the processing time to determine the items support using F-DIST from DOSTrieIT is outperformed the classical FP-Tree technique. Furthermore, the processing time to construct a complete tree data structure for DOSTrieIT is lesser than the benchmarked CanTree data structure.

[1]  Jemal H. Abawajy,et al.  IPMA: Indirect Patterns Mining Algorithm , 2013, Advanced Methods for Computational Collective Intelligence.

[2]  Tutut Herawan,et al.  Mining critical least association rules of student suffering language and social anxieties , 2013 .

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

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

[5]  Mustafa Mat Deris,et al.  A soft set approach for association rules mining , 2011, Knowl. Based Syst..

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

[7]  Young-Koo Lee,et al.  Sliding window-based frequent pattern mining over data streams , 2009, Inf. Sci..

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

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

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

[11]  Jemal H. Abawajy,et al.  EFP-M2: Efficient Model for Mining Frequent Patterns in Transactional Database , 2012, ICCCI.

[12]  Mustafa Mat Deris,et al.  Tracing significant association rules using critical least association rules model , 2013 .

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

[14]  Tomasz Imielinski,et al.  Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..

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

[16]  Young-Koo Lee,et al.  CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining , 2008, PAKDD.

[17]  J. Yu,et al.  Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree , 2004, Data Mining and Knowledge Discovery.

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

[19]  P. V. G. D. Prasad Reddy,et al.  Batch Processing for Incremental FP-tree Construction , 2010 .

[20]  Ee-Peng Lim,et al.  A support-ordered trie for fast frequent itemset discovery , 2004, IEEE Transactions on Knowledge and Data Engineering.

[21]  Tutut Herawan,et al.  CNAR-M: A Model for Mining Critical Negative Association Rules , 2012, ISICA.

[22]  Rakesh Agrawal,et al.  Parallel Mining of Association Rules: Design, Implementation and Experience , 1999 .

[23]  Renata Iváncsy,et al.  Fast Discovery of Frequent Itemsets: a Cubic Structure-Based Approach , 2005, Informatica.