Impact of regularization on spectral clustering

DOI10.1214/16-AOS1447zbMath1357.62229arXiv1312.1733MaRDI QIDQ309744

Antony Joseph, Bin Yu

Publication date: 7 September 2016

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1733

zbMATH Keywords

regularization; network analysis; community detection; stochastic block model; regularized spectral clustering (RSC)

Mathematics Subject Classification ID

62H99: Multivariate analysis

62G20: Asymptotic properties of nonparametric inference

62H30: Classification and discrimination; cluster analysis (statistical aspects)

62G05: Nonparametric estimation

Related Items

Analysis of spectral clustering algorithms for community detection: the general bipartite setting, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Enhanced Equivalence Projective Simulation: A Framework for Modeling Formation of Stimulus Equivalence Classes, Graph Powering and Spectral Robustness, Detecting Overlapping Communities in Networks Using Spectral Methods, Community Detection in Sparse Networks Using the Symmetrized Laplacian Inverse Matrix (SLIM), Randomized Spectral Clustering in Large-Scale Stochastic Block Models, Hierarchical Community Detection by Recursive Partitioning, Modularity Maximization for Graphons, Large volatility matrix analysis using global and national factor models, Fast Network Community Detection With Profile-Pseudo Likelihood Methods, Estimating mixed-memberships using the symmetric Laplacian inverse matrix, Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks, Impact of regularization on spectral clustering, Spectral clustering in the dynamic stochastic block model, Community detection in sparse networks via Grothendieck's inequality, Community detection by \(L_{0}\)-penalized graph Laplacian, Estimating a network from multiple noisy realizations, On semidefinite relaxations for the block model, Limit theorems for eigenvectors of the normalized Laplacian for random graphs, Fusing data depth with complex networks: community detection with prior information, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, A review on spectral clustering and stochastic block models, Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator, Role of normalization in spectral clustering for stochastic blockmodels

Cites Work

• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• Impact of regularization on spectral clustering
• Spectral clustering and the high-dimensional stochastic blockmodel
• On the convergence to equilibrium of Kac's random walk on matrices
• Matrix concentration inequalities via the method of exchangeable pairs
• A nonparametric view of network models and Newman–Girvan and other modularities
• Improved Spectral-Norm Bounds for Clustering
• Community structure in social and biological networks
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• Improved Cheeger's inequality