NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data

In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select onl...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 845; pp. 1 - 20
Main Authors Demko, Christophe, Bertet, Karell, Faucher, Cyril, Viaud, Jean-François, Kuznetsov, Sergei O.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 12.12.2020
Elsevier
Subjects
Artificial Intelligence
Computer Science
Formal Concept Analysis
Heterogeneous data
Information Retrieval
Lattice
Pattern structures
Strategies
Formal Concept Analysis
Heterogeneous data
Pattern structures
Lattice
Strategies
Online AccessGet full text
ISSN0304-3975
1879-2294
1879-2294
DOI10.1016/j.tcs.2020.08.026

Cover

More Information
Summary:In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select only some predecessors of each concept, avoiding the generation of unreasonably large lattices. The algorithm is then extended to any type of data in a generic way. It is inspired by the pattern structure theory, where data are locally described by predicates independent of their types, allowing the management of heterogeneous data.
ISSN:0304-3975
1879-2294
1879-2294
DOI:10.1016/j.tcs.2020.08.026