Approximate Seriation in Formal Concept Analysis

François Brucker (1, 2) , Pascal Préa (1, 2)

1 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle
2 LIS - Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)

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.

Mots clés: Lattice; Consecutive One's Property; PQ-Trees; Seriation; Consensus

Domaines: Combinatoire [math.CO]; Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]

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