Learning Graph Representation via Formal Concept Analysis

12/08/2018
by   Yuka Yoneda, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2019

A Quality Metric for Visualization of Clusters in Graphs

Traditionally, graph quality metrics focus on readability, but recent st...
research
06/30/2019

Rough concepts

The present paper proposes a novel way to unify Rough Set Theory and For...
research
11/12/2021

Using Bayesian Network Analysis to Reveal Complex Natures of Relationships

Relationships are vital for mankind in many aspects. According to Maslow...
research
05/05/2020

Cluster-based dual evolution for multivariate systems

This paper proposes a cluster-based method to analyse multivariate syste...
research
10/20/2019

Representation Learning for Discovering Phonemic Tone Contours

Tone is a prosodic feature used to distinguish words in many languages, ...
research
08/14/2017

Graph Classification via Deep Learning with Virtual Nodes

Learning representation for graph classification turns a variable-size g...
research
08/27/2022

Geometrical Homogeneous Clustering for Image Data Reduction

In this paper, we present novel variations of an earlier approach called...

Please sign up or login with your details

Forgot password? Click here to reset