Relational concept discovery in structured datasets

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, knowledge bases, 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. Therefore, several attempts have been made to introduce relations into the formal concept analysis field which otherwise generated a large number of knowledge discovery methods and tools. However, the proposed approaches invariably look at relations as an intra-concept construct, typically relating two parts of the concept description, and therefore can only lead to the discovery of coarse-grained patterns. As an approach towards the discovery of finer-grain relational concepts, we propose to enhance the classical (object × attribute) data representations with a new dimension that is made out of inter-object links (e.g., spouse, friend, manager-of, etc.). Consequently, the discovered concepts are linked by relations which, like associations in conceptual data models such as the entity-relation diagrams, abstract from existing links between concept instances. The borders for the application of the relational mining task are provided by what we call a relational context family, a set of binary data tables representing individuals of various sorts (e.g., human beings, companies, vehicles, etc.) related by additional binary relations. As we impose no restrictions on the relations in the dataset, a major challenge is the processing of relational loops among data items. We present a method for constructing concepts on top of circular descriptions which is based on an iterative approximation of the final solution. The underlying construction methods are illustrated through their application to the restructuring of class hierarchies in object-oriented software engineering, which are described in UML.

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

[2]  William E. Lorensen,et al.  Object-Oriented Modeling and Design , 1991, TOOLS.

[3]  Hervé Leblanc,et al.  Galois lattice as a framework to specify building class hierarchies algorithms , 2000, RAIRO Theor. Informatics Appl..

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

[5]  Marianne Huchard,et al.  Extracting Formal Concepts out of Relational Data , 2003 .

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

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

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

[9]  Petko Valtchev,et al.  Galicia : an open platform for lattices , 2003 .

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

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

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

[13]  Lotfi Lakhal,et al.  iO2 - An Algorithmic Method for Building Inheritance Graphs in Object Database Design , 1996, ER.

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

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

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

[17]  Ivar Jacobson,et al.  Unified Modeling Language User Guide, The (2nd Edition) (Addison-Wesley Object Technology Series) , 2005 .

[18]  M. Bouzeghoub,et al.  Object Technology , 1997 .

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

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

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

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

[23]  Laurian M. Chirica,et al.  The entity-relationship model: toward a unified view of data , 1975, SIGF.

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

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

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

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

[28]  Marianne Huchard,et al.  Implémentation des Règles d'Aide à la Construction , 2002 .

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

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

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