AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering
arXiv:1609.06457
Abstract
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.
arXiv admin note: substantial text overlap with arXiv:1604.03159
References in corpus (11)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Spectral redemption: clustering sparse networks
- Signal Recovery on Graphs: Variation Minimization
- Dynamic stochastic blockmodels for time-evolving social networks
- Local-set-based Graph Signal Reconstruction
- Clustering with Multi-Layer Graphs: A Spectral Perspective
- Multi-layer graph analysis for dynamic social networks
- Phase Transitions in Spectral Community Detection
- Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering