Consistency of Lloyd's algorithm under perturbations
From MaRDI portal
Cites work
- A central limit theorem for k-means clustering
- A nonparametric view of network models and Newman–Girvan and other modularities
- A proof of the block model threshold conjecture
- A provable initialization and robust clustering method for general mixture models
- A tail inequality for quadratic forms of subgaussian random vectors
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Achieving optimal misclassification proportion in stochastic block models
- An \({\ell_p}\) theory of PCA and spectral clustering
- An analysis of classical multidimensional scaling with applications to clustering
- Center-based clustering under perturbation stability
- Community detection and stochastic block models: recent developments
- Community detection in degree-corrected block models
- Concentration inequalities. A nonasymptotic theory of independence
- Consistency of spectral clustering in stochastic block models
- Discussion of a set of points in terms of their mutual distances.
- Entrywise eigenvector analysis of random matrices with low expected rank
- Estimation of Subgraph Densities in Noisy Networks
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 51427 (Why is no real title available?)
- scientific article; zbMATH DE number 3605818 (Why is no real title available?)
- Impact of regularization on spectral clustering
- Information criteria for latent factor models: a study on factor pervasiveness and adaptivity
- Latent Space Approaches to Social Network Analysis
- Least squares quantization in PCM
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling. I: Theory and method
- Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
- On some significance tests in cluster analysis
- Optimality of spectral clustering in the Gaussian mixture model
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Pseudo-likelihood methods for community detection in large sparse networks
- Random Dot Product Graph Models for Social Networks
- Reconstruction and estimation in the planted partition model
- Robust \(k\)-means clustering for distributions with two moments
- Robust high-dimensional factor models with applications to statistical machine learning
- Sharp optimal recovery in the two component Gaussian mixture model
- Some distance properties of latent root and vector methods used in multivariate analysis
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral redemption in clustering sparse networks
- Statistical Significance of Clustering for High-Dimension, Low–Sample Size Data
- Statistical Significance of Clustering with Multidimensional Scaling
- Strong consistency of k-means clustering
- The Planar k-Means Problem is NP-Hard
- Universally consistent vertex classification for latent positions graphs
- Variational Inference for Stochastic Block Models From Sampled Data
This page was built for publication: Consistency of Lloyd's algorithm under perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255979)
