Steps Towards Achieving Distributivity in Formal Concept Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Steps Towards Achieving Distributivity in Formal Concept Analysis


In this paper we study distributive lattices in the framework of Formal Concept Analysis (FCA). The main motivation comes from phylogeny where biological derivations and parsimonious trees can be represented as median graphs. There exists a close connection between distributive lattices and median graphs. Moreover, FCA provides efficient algorithms to build concept lattices. However, a concept lattice is not necessarily distributive and thus it is not necessarily a median graph. In this paper we investigate possible ways of transforming a concept lattice into a distributive one, by making use Birkhoff’s representation of distributive lattices. We detail the operation that transforms a reduced context into a context of a distributive lattice. This allows us to reuse the FCA algorithmic machinery to build and to visualize distributive concept lattices, and then to study the associated median graphs.
Fichier principal
Vignette du fichier
cla2018_paper19.pdf (321.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01889163 , version 1 (27-10-2018)


  • HAL Id : hal-01889163 , version 1


Alain Gély, Miguel Couceiro, Amedeo Napoli. Steps Towards Achieving Distributivity in Formal Concept Analysis. CLA 2018 - The 14th International Conference on Concept Lattices and Their Applications, Jun 2018, Olomouc, Czech Republic. pp.291. ⟨hal-01889163⟩
89 View
138 Download


Gmail Facebook X LinkedIn More