Learning Graph Representation via Formal Concept Analysis
We present a novel method that can learn a graph representation from multivariate data. In our representation, each node represents a cluster of data points and each edge represents the subset-superset relationship between clusters, which can be mutually overlapped. The key to our method is to use formal concept analysis (FCA), which can extract hierarchical relationships between clusters based on the algebraic closedness property. We empirically show that our method can effectively extract hierarchical structures of clusters compared to the baseline method.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Scalable Formal Concept Analysis algorithm for large datasets using Spark
In the process of knowledge discovery and representation in large datasets using formal concept analysis, complexity plays a major role in identifying all the formal concepts and constructing the concept lattice(digraph …
graph constructionECD Knowledge Representation : Fundamental Concepts of the Unit Graphs Framework (Repr\'esentation des connaissances du DEC: Concepts fondamentaux du formalisme des Graphes d'Unit\'es) [in French]
Conceptual Collectives
The notions of formal contexts and concept lattices, although introduced by Wille only ten years ago, already have proven to be of great utility in various applications such as data analysis and knowledge representation.…
Quantum aspects of high dimensional formal representation of conceptual spaces
Human cognition is a complex process facilitated by the intricate architecture of human brain. However, human cognition is often reduced to quantum theory based events in principle because of their correlative conjecture…
Vocal Bursts Intensity PredictioncgSpan: Pattern Mining in Conceptual Graphs
Conceptual Graphs (CGs) are a graph-based knowledge representation formalism. In this paper we propose cgSpan a CG frequent pattern mining algorithm. It extends the DMGM-GSM algorithm that takes taxonomy-based labeled gr…