Optimality of spectral clustering in the Gaussian mixture model
From MaRDI portal
Publication:2054516
DOI10.1214/20-AOS2044zbMath1480.62129arXiv1911.00538OpenAlexW3211977733MaRDI QIDQ2054516
Anderson Y. Zhang, Harrison H. Zhou, Matthias Löffler
Publication date: 3 December 2021
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.00538
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inference from stochastic processes and spectral analysis (62M15)
Related Items (5)
Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method ⋮ Optimal estimation and computational limit of low-rank Gaussian mixtures ⋮ Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach ⋮ Sharp optimal recovery in the two component Gaussian mixture model ⋮ An \({\ell_p}\) theory of PCA and spectral clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Fast community detection by SCORE
- Minimax rates of community detection in stochastic block models
- Asymptotics and concentration bounds for bilinear forms of spectral projectors of sample covariance
- A spectral algorithm for learning mixture models
- Spectral clustering and the high-dimensional stochastic blockmodel
- An improved spectral bisection algorithm and its application to dynamic load balancing
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality
- Community detection in degree-corrected block models
- Adaptive estimation of a quadratic functional by model selection.
- Entrywise eigenvector analysis of random matrices with low expected rank
- High dimensional deformed rectangular matrices with applications in matrix denoising
- Partial recovery bounds for clustering with the relaxed \(K\)-means
- Consistency of spectral clustering in stochastic block models
- Role of normalization in spectral clustering for stochastic blockmodels
- Consistency of spectral clustering
- Perturbation of Linear Forms of Singular Vectors Under Gaussian Noise
- Consistent selection of the number of clusters via crossvalidation
- Mathematical Foundations of Infinite-Dimensional Statistical Models
- Graph Partitioning via Adaptive Spectral Techniques
- On clusterings
- Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
- The Planar k-Means Problem is NP-Hard
- Spectral Algorithms
- On the Quality of Spectral Separators
- A Simple SVD Algorithm for Finding Hidden Partitions
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting
- Least squares quantization in PCM
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Cutoff for Exact Recovery of Gaussian Mixture Models
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- Uniform Convergence of Adaptive Graph-Based Regularization
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Learning Theory
- An r-Dimensional Quadratic Placement Algorithm
This page was built for publication: Optimality of spectral clustering in the Gaussian mixture model
