.png){kind=icon}
.png){kind=icon}
Return
Consistency between ordering and clustering methods for graphs
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.5.023006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A relational dataset is often analyzed by optimally assigning a label to each element through clustering or ordering. While similar characterizations of a dataset would be achieved by both clustering and ordering methods, the former has been studied much more actively than the latter, particularly for the data represented as graphs. This study fills this gap by investigating methodological relationships between several clustering and ordering methods, focusing on spectral techniques. Furthermore, we evaluate the resulting performance of the clustering and ordering methods. To this end, we propose a measure called the label continuity error, which generically quantifies the degree of consistency between a sequence and partition for a set of elements. Based on synthetic and real-world datasets, we evaluate the extents to which an ordering method identifies a module structure and a clustering method identifies a banded structure.
Keywords:
STOCHASTIC BLOCKMODELS
COMMUNITY DETECTION
Journal
IF:
4.2
Papers:
7.6K
Citations:
2.7W