Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering
원문 초록
One of the longstanding open problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. We propose automated model order selection (AMOS), a solution to the SGC model selection problem under a random interconnection model (RIM) using a novel selection criterion that is based on an asymptotic phase transition analysis. AMOS can more generally be applied to discovering hidden block diagonal structure in symmetric non-negative matrices. Numerical experiments on simulated graphs validate the phase transition analysis, and real-world network data is used to validate the performance of the proposed model selection procedure.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
An Internal Validity Index Based on Density-Involved Distance
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Unsupervised Graph Clustering with Deep Structural Entropy
Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning
Rhomboid Tiling for Geometric Graph Deep Learning
Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.