Some Links Between Formal Concept Analysis and Graph Mining - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Book Sections Year : 2006

Some Links Between Formal Concept Analysis and Graph Mining

Michel Liquière
  • Function : Author
  • PersonId : 938480


This chapter presents a formal model to learning from examples represented by labelled graphs. This formal model is based upon lattice theory and in particular Galois lattices. We widen the domain of formal concept analysis, by the use of the Galois lattices model with structural descriptions of examples and concepts. The operational implementation of our model, called "Graal" (for GRAph And Learning) constructs a Galois lattice for any description language provided that the operations of comparison and generalization are determined for that language. These operations exist in the case of labelled graphs satisfying an partial order relation (homomorphism). This paper is concerned as well with the known problems regarding propositionalization (i.e. the transformation of a structural description in a propositional description). Using classical lattice results, we have a formal model for the transformation of a structural machine learning problem into a propositional one.
Fichier principal
Vignette du fichier
ChapHolderF1.pdf (322.1 Ko) Télécharger le fichier

Dates and versions

lirmm-00137035 , version 1 (16-03-2007)


  • HAL Id : lirmm-00137035 , version 1


Michel Liquière. Some Links Between Formal Concept Analysis and Graph Mining. Cook, Diane J. / Holder, Lawrence B. Mining Graph Data, John Wiley & Sons, pp.227-252, 2006, ISBN-10: 0471731900 ISBN-13: 978-0471731900. ⟨lirmm-00137035⟩
159 View
394 Download


Gmail Facebook X LinkedIn More