Attribute-incremental construction of the canonical implication basis

We propose a new algorithm constructing the canonical implication basis of a formal context. Being incremental, the algorithm processes a single attribute of the context at a single step. Experimental results bear witness to its competitiveness.

[1]  Sébastien Ferré.  Incremental Concept Formation made More Efficient by the Use of Associative Concepts , 2002 .

[2]  Giorgio Ausiello,et al.  Minimal Representation of Directed Hypergraphs , 1986, SIAM J. Comput..

[3]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[4]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[5]  Claudio Carpineto,et al.  A lattice conceptual clustering system and its application to browsing retrieval , 2004, Machine Learning.

[6]  C. Dowling.  On the irredundant generation of knowledge spaces , 1993 .

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

[8]  Yves Bastide,et al.  Computing Proper Implications , 2001 .

[9]  Alan Day,et al.  The Lattice Theory of Functional Dependencies and Normal Decompositions , 1992, Int. J. Algebra Comput..

[10]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

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

[12]  Rokia Missaoui,et al.  INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES , 1995, Comput. Intell..

[13]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[14]  Derrick G. Kourie,et al.  AddIntent: A New Incremental Algorithm for Constructing Concept Lattices , 2004, ICFCA.

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

[16]  Marcel Wild,et al.  Computations with Finite Closure Systems and Implications , 1995, COCOON.

[17]  Sergei O. Kuznetsov,et al.  On the Intractability of Computing the Duquenne?Guigues Bas , 2004, J. Univers. Comput. Sci..

[18]  Heikki Mannila,et al.  Design of Relational Databases , 1992 .