Cross-validation estimate of the number of clusters in a network
arXiv:1605.07915 · doi:10.1038/s41598-017-03623-x
Abstract
Network science investigates methodologies that summarise relational data to obtain better interpretability. Identifying modular structures is a fundamental task, and assessment of the coarse-grain level is its crucial step. Here, we propose principled, scalable, and widely applicable assessment criteria to determine the number of clusters in modular networks based on the leave-one-out cross-validation estimate of the edge prediction error.
arXiv comment19 pages, 9 figures
References in corpus (25)
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Maps of random walks on complex networks reveal community structure
- A survey of cross-validation procedures for model selection
- Benchmark graphs for testing community detection algorithms
- Defining and identifying communities in networks
- Stochastic blockmodels and community structure in networks
- Community detection in complex networks using Extremal Optimization
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Spectral redemption: clustering sparse networks
- The ground truth about metadata and community detection in networks
- Spectral methods for network community detection and graph partitioning
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Phase transition in the detection of modules in sparse networks
- Structure and inference in annotated networks
- Consistency of community detection in networks under degree-corrected stochastic block models
- Hierarchical Block Structures and High-resolution Model Selection in Large Networks
- Parsimonious module inference in large networks
- Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
- Estimating the number of communities in a network
- Model Selection for Degree-corrected Block Models
Cited by in corpus (6)
- Simplicial Closure and higher-order link prediction
- Evaluating Overfit and Underfit in Models of Network Community Structure
- Consistencies and inconsistencies between model selection and link prediction in networks
- Comparative analysis on the selection of number of clusters in community detection
- Democratic summary of public opinions in free-response surveys
- Single-trajectory map equation