Journal
THEORETICAL COMPUTER SCIENCE
Volume 845, Issue -, Pages 1-20Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2020.08.026
Keywords
Formal Concept Analysis; Lattice; Pattern structures; Strategies; Heterogeneous data
Categories
Funding
- Russian Science Foundation [17-11-01276]
- Russian Science Foundation [17-11-01276, 20-11-18037] Funding Source: Russian Science Foundation
Ask authors/readers for more resources
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. (C) 2020 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available