Formal Concept Analysis

Formal concept analysis (FCA) is a mathematical theory about concepts and concept hierarchies. Based on lattice theory, it allows to derive concept hierarchies from datasets. In this survey, we recall the basic notions of FCA, including its relationship to folksonomies. The survey is concluded by a list of FCA based knowledge engineering solutions.

[1]  Klaus Biedermann,et al.  How Triadic Diagrams Represent Conceptual Structures , 1997, ICCS.

[2]  R. Wille,et al.  On the modal understanding of triadic contexts , 2000 .

[3]  Andreas Hotho,et al.  Discovering shared conceptualizations in folksonomies , 2008, J. Web Semant..

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

[5]  Gerd Stumme,et al.  Document retrieval for e-mail search and discovery using formal concept analysis , 2003, Appl. Artif. Intell..

[6]  Steffen Staab,et al.  Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis , 2005, J. Artif. Intell. Res..

[7]  Guido Boella,et al.  Normative framework for normative system change , 2009, AAMAS 2009.

[8]  Nicolas Pasquier,et al.  Pruning closed itemset lattices for associations rules , 1998, BDA.

[9]  Toon Calders,et al.  Mining All Non-derivable Frequent Itemsets , 2002, PKDD.

[10]  Jean-François Boulicaut,et al.  Approximation of Frequency Queris by Means of Free-Sets , 2000, PKDD.

[11]  Michael Luxenburger,et al.  Implications partielles dans un contexte , 1991 .

[12]  Andreas Hotho,et al.  Mining Association Rules in Folksonomies , 2006, Data Science and Classification.

[13]  Julien Tane,et al.  Query-Based Multicontexts for Knowledge Base Browsing: An Evaluation , 2006, ICCS.

[14]  Steffen Staab Emergent Semantics , 2002, IEEE Intell. Syst..

[15]  Andreas Hotho,et al.  Information Retrieval in Folksonomies: Search and Ranking , 2006, ESWC.

[16]  Andreas Hotho,et al.  BibSonomy: a social bookmark and publication sharing system , 2006 .

[17]  Bernhard Ganter,et al.  Implications in Triadic Formal Contexts , 2004, ICCS.

[18]  Claudio Carpineto,et al.  GALOIS: An Order-Theoretic Approach to Conceptual Clustering , 1993, ICML.

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

[20]  Bernhard Ganter,et al.  Completing Description Logic Knowledge Bases Using Formal Concept Analysis , 2007, IJCAI.

[21]  Guy W. Mineau,et al.  Automatic Structuring of Knowledge Bases by Conceptual Clustering , 1995, IEEE Trans. Knowl. Data Eng..

[22]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[23]  Rudolf Wille,et al.  A Triadic Approach to Formal Concept Analysis , 1995, ICCS.

[24]  Olivier Ridoux,et al.  A File System Based on Concept Analysis , 2000, Computational Logic.

[25]  Gregor Snelting Concept Lattices in Software Analysis , 2005, Formal Concept Analysis.

[26]  Olivier Ridoux,et al.  A Logical Generalization of Formal Concept Analysis , 2000, ICCS.

[27]  Rudolf Wille,et al.  Conceptual Graphs and Formal Concept Analysis , 1997, ICCS.

[28]  Rudolf Wille,et al.  Conceptual Structures of Multicontexts , 1996, ICCS.

[29]  John F. Sowa,et al.  Conceptual Structures: Information Processing in Mind and Machine , 1983 .

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

[31]  Rudolf Wille Restructuring mathematical logic: an approach based on Peirce's pragmatism , 1996 .

[32]  Gerd Stumme,et al.  Computing iceberg concept lattices with T , 2002, Data Knowl. Eng..

[33]  Andreas Hotho,et al.  TRIAS--An Algorithm for Mining Iceberg Tri-Lattices , 2006, Sixth International Conference on Data Mining (ICDM'06).

[34]  Wolfgang Hesse,et al.  Formal Concept Analysis Used for Software Analysis and Modelling , 2005, Formal Concept Analysis.

[35]  Gerd Stumme,et al.  Knowledge acquisition by distributive concept exploration , 1995 .

[36]  Pierre Nicole,et al.  La Logique Ou L'art De Penser,: Contenant Outre Les Regles Communes, Plusieurs Observations Nouvelles, Propres À Former Le Jugement.. , 2010 .

[37]  Rudolf Wille,et al.  Conceptual Clustering via Convex-Ordinal Structures , 1993 .

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

[39]  Gerd Stumme,et al.  A Finite State Model for On-Line Analytical Processing in Triadic Contexts , 2005, ICFCA.

[40]  Gerd Stumme,et al.  Semantic resource management for the web: an e-learning application , 2004, WWW Alt. '04.

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

[42]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

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

[44]  Peter W. Eklund,et al.  FCA-Based Browsing and Searching of a Collection of Images , 2006, ICCS.

[45]  Frank Tip,et al.  Understanding class hierarchies using concept analysis , 2000, TOPL.

[46]  Christophe Rigotti,et al.  A condensed representation to find frequent patterns , 2001, PODS '01.

[47]  Gerd Stumme,et al.  FCA-MERGE: Bottom-Up Merging of Ontologies , 2001, IJCAI.

[49]  Rudolf Wille,et al.  The Basic Theorem of triadic concept analysis , 1995 .

[50]  Andreas Hotho,et al.  Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies , 2004, ICFCA.

[51]  Laurent Chaudron,et al.  Generalized Formal Concept Analysis , 2000, ICCS.

[52]  Gregor Snelting,et al.  Reengineering of configurations based on mathematical concept analysis , 1996, TSEM.

[53]  Klaus Biedermann,et al.  Triadic Galois connections , 1997 .

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

[55]  Gerd Stumme,et al.  Creation and Merging of Ontology Top-Levels , 2003, ICCS.

[56]  Peter Becker,et al.  A Survey of Formal Concept Analysis Support for Software Engineering Activities , 2005, Formal Concept Analysis.

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

[58]  Susanne Prediger,et al.  Logical Scaling in Formal Concept Analysis , 1997, ICCS.

[59]  Bernhard Ganter,et al.  Contextual Attribute Logic , 1999, ICCS.

[60]  François Rioult,et al.  Extraction de connaissances dans les bases de donn'ees comportant des valeurs manquantes ou un grand nombre d'attributs , 2005 .

[61]  Gerd Stumme,et al.  Mining frequent patterns with counting inference , 2000, SKDD.