Approximate Seriation in Formal Concept Analysis

Abstract : We present in this paper an algorithmically efficient (linear in the size of the formal context) method to solve the seriation problem for formal contexts. We show that any maximal solution can be represented by a PQ-Tree. Moreover, the set of PQ-Trees can be seen as a distributive lattice. This lattice yields a consensus method which deals with the multiple solutions.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02435801
Contributor : Pascal Préa <>
Submitted on : Saturday, January 11, 2020 - 2:55:49 PM
Last modification on : Thursday, January 16, 2020 - 1:38:42 AM

File

Approximate_Seriation.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02435801, version 1

Collections

Citation

François Brucker, Pascal Préa. Approximate Seriation in Formal Concept Analysis. CLA, 2016, Moscou, Russia. ⟨hal-02435801⟩

Share

Metrics

Record views

5

Files downloads

6