Incrementally building frequent closed itemset lattice

A concept lattice is an ordered structure between concepts. It is particularly effective in mining association rules. However, a concept lattice is not efficient for large databases because the lattice size increases with the number of transactions. Finding an efficient strategy for dynamically updating the lattice is an important issue for real-world applications, where new transactions are constantly inserted into databases. To build an efficient storage structure for mining association rules, this study proposes a method for building the initial frequent closed itemset lattice from the original database. The lattice is updated when new transactions are inserted. The number of database rescans over the entire database is reduced in the maintenance process. The proposed algorithm is compared with building a lattice in batch mode to demonstrate the effectiveness of the proposed algorithm.

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

[2]  Amedeo Napoli,et al.  A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes , 2013, Annals of Mathematics and Artificial Intelligence.

[3]  Jian Pei,et al.  CLOSET+: searching for the best strategies for mining frequent closed itemsets , 2003, KDD '03.

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

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

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

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

[8]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

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

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

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

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

[13]  Tzung-Pei Hong,et al.  DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets , 2012, Expert Syst. Appl..

[14]  Beatrice Gralton,et al.  Washington DC - USA , 2008 .