AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering
원문 초록
One of the longstanding 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. In this paper, we propose AMOS, an automated model order selection algorithm for SGC. Based on a recent analysis of clustering reliability for SGC under the random interconnection model, AMOS works by incrementally increasing the number of clusters, estimating the quality of identified clusters, and providing a series of clustering reliability tests. Consequently, AMOS outputs clusters of minimal model order with statistical clustering reliability guarantees. Comparing to three other automated graph clustering methods on real-world datasets, AMOS shows superior performance in terms of multiple external and internal clustering metrics.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
Adaptive Local Clustering over Attributed Graphs
Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning
Rhomboid Tiling for Geometric Graph Deep Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.