期刊
THEORETICAL COMPUTER SCIENCE
卷 845, 期 -, 页码 1-20出版社
ELSEVIER
DOI: 10.1016/j.tcs.2020.08.026
关键词
Formal Concept Analysis; Lattice; Pattern structures; Strategies; Heterogeneous data
资金
- Russian Science Foundation [17-11-01276]
- Russian Science Foundation [17-11-01276, 20-11-18037] Funding Source: Russian Science Foundation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据