Skip to Main content Skip to Navigation
Conference papers

Conceptual Navigation for Polyadic Formal Concept Analysis

Abstract : Formal Concept Analysis (FCA) is a mathematically inspired field of knowledge representation with wide applications in knowledge discovery and decision support. Polyadic FCA is a generalization of classical FCA that instead of a binary uses an arbitrary, n-ary incidence relation to define formal concepts, i.e., data clusters in which all elements are interrelated. We discuss a paradigm for navigating the space of such (formal) concepts, based on so-called membership constraints. We present an implementation for the cases $$n\in \{2,3,4\}$$ using an encoding into answer-set programming (ASP) allowing us to exploit highly efficient strategies offered by optimized ASP solvers. For the case $$n=3$$, we compare this implementation to a second strategy that uses exhaustive search in the concept set, which is precomputed by an existing tool. We evaluate the implementation strategies in terms of performance. Finally, we discuss the limitations of each approach and the possibility of generalizations to n-ary datasets.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01950006
Contributor : Hal Ifip <>
Submitted on : Monday, December 10, 2018 - 3:09:27 PM
Last modification on : Thursday, January 7, 2021 - 2:30:03 PM
Long-term archiving on: : Monday, March 11, 2019 - 3:13:40 PM

File

469211_1_En_4_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Sebastian Rudolph, Christian Săcărea, Diana Troancă. Conceptual Navigation for Polyadic Formal Concept Analysis. 4th IFIP International Workshop on Artificial Intelligence for Knowledge Management (AI4KM), Jul 2016, New York, NY, United States. pp.50-70, ⟨10.1007/978-3-319-92928-6_4⟩. ⟨hal-01950006⟩

Share

Metrics

Record views

93

Files downloads

8