Conceptual Navigation for Polyadic Formal Concept Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Conceptual Navigation for Polyadic Formal Concept Analysis


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.
Fichier principal
Vignette du fichier
469211_1_En_4_Chapter.pdf (580.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01950006 , version 1 (10-12-2018)





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⟩
53 View
35 Download



Gmail Facebook Twitter LinkedIn More