ZooM: a nested Galois lattices-based system for conceptual clustering

This paper deals with the representation of multi-valued data by clustering them in a small number of classes organized in a hierarchy and described at an appropriate level of abstraction. The contribution of this paper is three fold. First, we investigate a partial order, namely nesting, relating Galois lattices. A nested Galois lattice is obtained by reducing (through projections) the original lattice. As a consequence it makes coarser the equivalence relations defined on extents and intents. Second we investigate the intensional and extensional aspects of the languages used in our system ZooM. In particular we discuss the notion of α-extension of terms of a class language £. We also present our most expressive language £3, close to a description logic, and which expresses optionality or/and multi-valuation of attributes. Finally, the nesting order between the Galois lattices corresponding to various languages and extensions is exploited in the interactive system ZooM. Typically a ZooM session starts from a propositional language £2 and a coarse view of the data (through α-extension). Then the user selects two ordered nodes in the lattice and ZooM constructs a fine-grained lattice between the antecedents of these nodes. So the general purpose of ZooM is to give a general view of concepts addressing a large data set, then focussing on part of this coarse taxonomy.

[1]  Marie-Catherine Daniel-Vatonne,et al.  On a tree-like representation for symbolic-numeric data and its use in Galois lattice method , 1998, Proceedings SCCC'98. 18th International Conference of the Chilean Society of Computer Science (Cat. No.98EX212).

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

[3]  Jean-Gabriel Ganascia TDIS : an Algebraic Formalization , 1993, IJCAI.

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

[5]  Claudio Carpineto,et al.  Inferring dependencies from relations: a conceptual clustering approach , 1999 .

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

[7]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[8]  Rokia Missaoui,et al.  Mthodes de Classification Conceptuelle Bases sur les Treillis de Galois et Applications , 1995 .

[9]  Paul E. Utgoff,et al.  Shift of bias for inductive concept learning , 1984 .

[10]  Nathalie Pernelle,et al.  Automatic Construction and Refinement of a Class Hierarchy over Multi-valued Data , 2001, PKDD.

[11]  Gerd Stumme,et al.  Conceptual Knowledge Discovery and Data Analysis , 2000, ICCS.

[12]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

[13]  William W. Cohen An Analysis of Representation Shift in Concept Learning , 1990, ML.

[14]  Gerd Stumme,et al.  Fast Computation of Concept lattices Using Data Mining Techniques , 2000, KRDB.

[15]  George Drastal,et al.  Induction in an Abstraction Space: A Form of Constructive Induction , 1989, IJCAI.

[16]  Peter F. Patel-Schneider,et al.  A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic , 1993, J. Artif. Intell. Res..

[17]  Engelbert Mephu Nguifo,et al.  IGLUE: an instance-based learning system over lattice theory , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[18]  Gerd Stumme,et al.  Local Scaling in Conceptual Data Systems , 1996, ICCS.

[19]  Henry Soldano,et al.  Tabata: A Learning Algorithm Performing a Bidirectional Search in a Reduced Search Space Using a Tabu Strategy , 1998, ECAI.

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

[21]  Kitsana Waiyamai,et al.  Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices , 2000, ECML.

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

[23]  Hans-Hermann Bock,et al.  Analysis of Symbolic Data , 2000 .

[24]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.