Incremental Construction of Alpha Lattices and Association Rules

In this paper we discuss Alpha Galois lattices (Alpha lattices for short) and the corresponding association rules. An alpha lattice is coarser than the related concept lattice and so contains fewer nodes, so fewer closed patterns, and a smaller basis of association rules. Coarseness depends on a a priori classification, i.e. a cover C of the powerset of the instance set I, and on a granularity parameter α. In this paper, we define and experiment a Merge operator that when applied to two Alpha lattices G(C1, α) and G(C2, α) generates the Alpha lattice G(C1∪C2, α), so leading to a class-incremental construction of Alpha lattices. We then briefly discuss the implementation of the incremental process and describe the min-max bases of association rules extracted from Alpha lattices.

[1]  Jean Sallantin,et al.  Structural Machine Learning with Galois Lattice and Graphs , 1998, ICML.

[2]  Franz Baader,et al.  KI 2001: Advances in Artificial Intelligence , 2001, Lecture Notes in Computer Science.

[3]  Rokia Missaoui,et al.  A partition-based approach towards constructing Galois (concept) lattices , 2002, Discret. Math..

[4]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.

[5]  Nathalie Pernelle,et al.  ZooM: a nested Galois lattices-based system for conceptual clustering , 2002, J. Exp. Theor. Artif. Intell..

[6]  Gerd Stumme,et al.  Conceptual Structures: Broadening the Base , 2001, Lecture Notes in Computer Science.

[7]  Bernhard Ganter,et al.  Formal Concept Analysis: Logical Foundations , 1999 .

[8]  Gerd Stumme,et al.  Generating a Condensed Representation for Association Rules , 2005, Journal of Intelligent Information Systems.

[9]  Mohammed J. Zaki.  Generating non-redundant association rules , 2000, KDD '00.

[10]  Amedeo Napoli,et al.  Knowledge-Based Selection of Association Rules for Text Mining , 2004, ECAI.

[11]  Hiroki Arimura,et al.  An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases , 2004, Discovery Science.

[12]  Henry Soldano,et al.  Alpha Galois Lattices: An Overview , 2005, ICFCA.

[13]  Alexandre Termier,et al.  DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm , 2008, IEEE Transactions on Knowledge and Data Engineering.

[14]  Rokia Missaoui,et al.  Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory , 2002, J. Exp. Theor. Artif. Intell..

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

[16]  Hiroki Arimura,et al.  Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data , 2008, PAKDD.

[17]  Yves Bastide,et al.  Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis , 2001, KI/ÖGAI.