Extracting Formal Concepts out of Relational Data

Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as databases, both relational and object-oriented, or software models, e.g., UML class diagrams. When processing such complex datasets, it is of prime importance for an analysis tool to hold as much as possible to the initial format so that the semantics is preserved and the interpretation of the final results eased. There have been several attempts to introduce relations into the Galois lattice and formal concept analysis fields. We propose a novel approach to this problem which relies on an enhanced version of the classical binary data descriptions based on the distinction of several mutually related formal contexts.

[1]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[2]  Rokia Missaoui,et al.  Design of Class Hierarchies Based on Concept (Galois) Lattices , 1998, Theory Pract. Object Syst..

[3]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[4]  Ivar Jacobson,et al.  The Unified Modeling Language User Guide , 1998, J. Database Manag..

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

[6]  Robert E. Kent,et al.  Rough Concept Analysis: A Synthesis of Rough Sets and Formal Concept Analysis , 1996, Fundam. Informaticae.

[7]  Frank Vogt,et al.  TOSCANA - a Graphical Tool for Analyzing and Exploring Data , 1994, GD.

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

[9]  Hafedh Mili,et al.  Building and maintaining analysis-level class hierarchies using Galois Lattices , 1993, OOPSLA '93.

[10]  S. Džeroski,et al.  Relational Data Mining , 2001, Springer Berlin Heidelberg.

[11]  Rokia Missaoui,et al.  Knowledge Discovery in Complex Objects , 1999, Comput. Intell..

[12]  Sergei O. Kuznetsov,et al.  Learning of Simple Conceptual Graphs from Positive and Negative Examples , 1999, PKDD.

[13]  Petko Valtchev Building Classes in Object-Based Languages by Automatic Clustering , 1999, IDA.

[14]  E. Diday,et al.  Treillis de Galois maximaux et capacités de Choquet , 1997 .

[15]  Marianne Huchard,et al.  On automatic class insertion with overloading , 1996, OOPSLA '96.

[16]  Fred S. Roberts,et al.  Applications of combinatorics and graph theory to the biological and social sciences , 1989 .

[17]  Frank Tip,et al.  Reengineering class hierarchies using concept analysis , 1998, SIGSOFT '98/FSE-6.

[18]  Gerd Stumme,et al.  Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis , 1999, ICCS.

[19]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

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