Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis

Formal Concept Analysis provides a mathematical model of the concept which is used in data analysis for examining conceptual hierarchies in data tables. If these tables are too large to be completely given, then the conceptual structure has to be determined in an interactive knowledge acquisition process from an expert of the domain. The expert is asked either to confirm them or to provide typical counter-examples. The result of the exploration is a lattice that is generated by addind all largest common subconcepts and/or least common superconcepts.

[1]  Gerd Stumme,et al.  Attribute Exploration with Background Implications and Exceptions , 1996 .

[2]  Gerd Stumme.  Exploration tools in formal concept analysis , 1996 .

[3]  Gerd Stumme,et al.  The Concept Classification of a Terminology Extended by Conjunction and Disjunction , 1996, PRICAI.

[4]  A. Hales,et al.  On the non-existence of free complete Boolean algebras , 1964 .

[5]  Rudolf Wille,et al.  Tensorial decomposition of concept lattices , 1985 .

[6]  Bernhard Ganter,et al.  Formale Begriffsanalyse - mathematische Grundlagen , 1996 .

[7]  Gerd Stumme,et al.  Concept Exploration - A Tool for Creating and Exploring Conceptual Hierarchies , 1997, ICCS.

[8]  Peter Luksch,et al.  A Mathematical Model for Conceptual Knowledge Systems , 1991 .

[9]  Rudolf Wille.  Knowledge acquisition by methods of formal concept analysis , 1989 .

[10]  Gerd Stumme.  Concept exploration: knowledge acquisition in conceptual knowledge systems , 1997 .

[11]  Otto Opitz,et al.  Ordinal and Symbolic Data Analysis , 1996 .

[12]  Hans Michael Baumgartner,et al.  Handbuch philosophischer Grundbegriffe , 1973 .

[13]  John F. Sowa,et al.  Conceptual Structures: Fulfilling Peirce's Dream , 1997, Lecture Notes in Computer Science.

[14]  Herbert Heyde,et al.  Hörner und Zinken , 1984 .

[15]  Norman Y. Foo,et al.  PRICAI'96: Topics in Artificial Intelligence , 1996, Lecture Notes in Computer Science.

[16]  F. Baader.  Computing a Minimal Representation of the Subsumption Lattice of All Conjunctions of Concepts De ned in a Terminology ? , 1995 .