Mining incrementally closed item sets with constructive pattern set

Abstract Mining incrementally closed item sets is an essential problem in data mining. Once closed item sets and their frequencies are found, the frequentation of a found closed item set is always determined. In recent times, concept lattice has been used as an intermediate structure for the purpose of mining incrementally (frequent) closed sets. However, lattice operations are very time-consuming when data fluctuates as well as the memory for lattice is consumed a lot when data becomes large. This paper proposes an intermediate structure called constructive set to produce closed sets along with their occurrence frequencies. The constructive set is constructed from a set of group patterns – an extended form of bit chains. This paper also proposes algorithms based on the constructive set for mining incrementally closed sets when adding and removing transactions. The proposed algorithms along with storing and calculating on bit data have significant advantages shown through experiments and comparisons.

[1]  D. Cheung,et al.  Maintenance of Discovered Association Rules: When to update? , 1997, DMKD.

[2]  Rokia Missaoui,et al.  A framework for incremental generation of closed itemsets , 2008, Discret. Appl. Math..

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

[4]  Ming-Syan Chen,et al.  Sliding-window filtering: an efficient algorithm for incremental mining , 2001, CIKM '01.

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

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

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

[8]  Amedeo Napoli,et al.  Relational concept analysis: mining concept lattices from multi-relational data , 2013, Annals of Mathematics and Artificial Intelligence.

[9]  Yuchang Lu,et al.  Incremental Discovering Association Rules: A Concept Lattice Approach , 1999, PAKDD.

[10]  Tzung-Pei Hong,et al.  Using the Structure of Prelarge Trees to Incrementally Mine Frequent Itemsets , 2010, New Generation Computing.

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

[12]  Bay Vo,et al.  Incrementally building frequent closed itemset lattice , 2014, Expert Syst. Appl..

[13]  Srinivasan Parthasarathy,et al.  Mining Frequent Itemsets in Evolving Databases , 2002, SDM.

[14]  Yue-Shi Lee,et al.  An efficient algorithm for incrementally mining frequent closed itemsets , 2013, Applied Intelligence.

[15]  Tzung-Pei Hong,et al.  A lattice-based approach for mining most generalization association rules , 2013, Knowl. Based Syst..

[16]  P. V. G. D. Prasad Reddy,et al.  Batch incremental processing for FP-tree construction using FP-Growth algorithm , 2012, Knowledge and Information Systems.

[17]  Amedeo Napoli,et al.  Fast Mining of Iceberg Lattices: A Modular Approach Using Generators , 2011, CLA.

[18]  Christie I. Ezeife,et al.  Mining Incremental Association Rules with Generalized FP-Tree , 2002, Canadian Conference on AI.

[19]  Necip Fazil Ayan,et al.  An efficient algorithm to update large itemsets with early pruning , 1999, KDD '99.

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

[21]  Vasudha Bhatnagar,et al.  Mining Closed Itemsets in Data Stream Using Formal Concept Analysis , 2010, DaWak.

[22]  Rokia Missaoui,et al.  Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods , 2001, ICCS.

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

[24]  Sanjay Ranka,et al.  An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases , 1997, KDD.

[25]  Carson Kai-Sang Leung,et al.  CanTree: a tree structure for efficient incremental mining of frequent patterns , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[26]  Roberto J. Bayardo,et al.  Efficiently mining long patterns from databases , 1998, SIGMOD '98.

[27]  John F. Roddick,et al.  Incremental Association Mining using a Closed-Set Lattice , 2007, J. Res. Pract. Inf. Technol..

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