.png){kind=icon}
.png){kind=icon}
Return
Polyadic relational concept analysis
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2023.109067.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Formal concept analysis is a mathematical framework based on lattice theory that aims at representing the information contained in binary object-attribute datasets (called formal contexts) in the form of a lattice of so-called formal concepts. Since its introduction, it has been extended to more complex types of data. In this paper, we are interested in two of those extensions: relational concept analysis and polyadic concept analysis that allow to process, respectively, relational data and n-ary relations. We present a framework for polyadic relational concept analysis that extends relational concept analysis to relational datasets that are made of n-ary relations. We show its basic properties and that it is a valid extension of relational concept analysis.
Keywords:
Formal concept analysis
Polyadic concept analysis
Relational concept analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K
Organization
View more organizations