Steps Towards Achieving Distributivity in Formal Concept Analysis

Alain Gély 1, 2 Miguel Couceiro 1, 2 Amedeo Napoli 1, 2
2 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01889163
Contributor : Alain Gely <>
Submitted on : Saturday, October 27, 2018 - 1:16:21 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:02 PM
Long-term archiving on : Monday, January 28, 2019 - 12:56:24 PM

File

cla2018_paper19.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01889163, version 1

Citation

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⟩

Share

Metrics

Record views

63

Files downloads

67