Fetching the paper…
Reading the bibliography…
We determine the information-theoretic cutoff value on separation of cluster centers for exact recovery of cluster labels in a $K$-component Gaussian mixture model with equal cluster sizes.
Some methods for classification and analysis of multivariate observations
J.B. MacQueen · 1967
Earlier work this paper cites.
Maximum likelihood from incomplete data via the em algorithm
A. P. Dempster, N. M. Laird, and D. B. Rubin · 1977
Earlier work this paper cites.
Strong consistency of k k -means clustering
David Pollard · 1981
Earlier work this paper cites.
Least squares quantization in pcm
Stuart Lloyd · 1982
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
The solution of some random np-hard problems in polynomial expected time
M.E. Dyer and A.M. Frieze · 1989
Earlier work this paper cites.
Optimal rate of convergence for finite mixture models
Jiahua Chen · 1995
Earlier work this paper cites.
Weak Convergence and Empirical Processes: With Applications to Statistics
Aad van der Vaart and Jon A. Wellner · 1996
Earlier work this paper cites.
Cluster analysis and mathematical programming
Pierre Hansen and Brigitte Jaumard · 1997
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
B. Laurent and Massart P · 2000
Earlier work this paper cites.
Learning segmentation by random walks
Marina Meila and Jianbo Shi · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Andrew Y. Ng, Michael I. Jordan, and Yair Weiss · 2001
Earlier work this paper cites.
Model-based clustering, discriminant analysis, and density estimation
Chris Fraley and Adrian Raftery · 2002
Earlier work this paper cites.
A spectral algorithm for learning mixture models
Santosh Vempala and Grant Wang · 2004
Earlier work this paper cites.
On spectral learning of mixtures of distributions
Dimitris Achlioptas and Frank McSherry · 2005
Earlier work this paper cites.
Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
Jinho Baik, Gérard Ben Arous, and Sandrine Péché · 2005
Earlier work this paper cites.
K-means++: The advantages of careful seeding
David Arthur and Sergei Vassilvitskii · 2007
Earlier work this paper cites.
The hardness of k k -means clustering
Sanjoy Dasgupta · 2007
Earlier work this paper cites.
Asymptotics of sample eigenstructure for a large dimensional spiked covariance model
Debashis Paul · 2007
Earlier work this paper cites.
Approximating k k -means-type clustering via semidefinite programming
Jiming Peng and Yu Wei · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
Ulrike von Luxburg · 2007
Earlier work this paper cites.
A tail inequality for suprema of unbounded empirical processes with applications to markov chains
Radoslaw Adamczak · 2008
Earlier work this paper cites.
Consistency of spectral clustering
Ulrike von Luxburg, Mikhail Belkin, and Olivier Bousquet · 2008
Earlier work this paper cites.
Spectral algorithms
Ravindran Kannan and Santosh Vempala · 2009
Earlier work this paper cites.
The planar k-means problem is np-hard
Meena Mahajan, Prajakta Nimbhorkar, and Kasturi Varadarajan · 2009
Cited alongside, same era.
Clustering with spectral norm and the k-means algorithm
Amit Kumar and Ravindran Kannan · 2010
Cited alongside, same era.
The Design of Approximation Algorithms
David P. Williamson and David B. Shmoys · 2011
Cited alongside, same era.
Improved spectral-norm bounds for clustering
Pranjal Awasthi and Or Sheffet · 2012
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2012
Cited alongside, same era.
Spectral redemption in clustering sparse networks
Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, and Pan Zhang · 2013
Cited alongside, same era.
Clustering subgaussian mixtures by semidefinite programming
Dustin G. Mixon, Soledad Villar, and Rachel Ward · 2016
Later among the works it cites.
Belief propagation, robust reconstruction and optimal recovery of block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2016
Later among the works it cites.
Consistency thresholds for the planted bisection model
Elchanan Mossel, Joe Neeman, and Allan Sly · 2016
Later among the works it cites.
Global analysis of expectation maximization for mixtures of two gaussians
Ji Xu, Daniel Hsu, and Arian Maleki · 2016
Later among the works it cites.
Statistical guarantees for the em algorithm: From population to sample-based analysis
Sivaraman Balakrishnan, Martin J. Wainwright, and Bin Yu · 2017
Later among the works it cites.
Ten steps of em suffice for mixtures of two gaussians
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The effectiveness of lloyd-type methods for the k-means problem
Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, and Chaitanya Swamy · 2013
Cited alongside, same era.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Cited alongside, same era.
A note on the hanson-wright inequality for random vectors with dependencies
Radoslaw Adamczak · 2015
Cited alongside, same era.
Relax, no need to round: Integrality of clustering formulations
Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, and Rachel Ward · 2015
Cited alongside, same era.
Introduction to high-dimensional statistics
Christophe Giraud · 2015
Cited alongside, same era.
On the tightness of an SDP relaxation of k-means
Takayuki Iguchi, Dustin G. Mixon, Jesse Peterson, and Soledad Villar · 2015
Cited alongside, same era.
Constantinos Daskalakis, Christos Tzamos, and Manolis Zampetakis · 2017
Later among the works it cites.
When do birds of a feather flock together? k k -means, proximity, and conic programming
Xiaodong Li, Yang Li, Shuyang Ling, Thomas Stohmer, and Ke Wei · 2017
Later among the works it cites.
Adaptive clustering through semidefinite programming
Martin Royer · 2017
Later among the works it cites.
Convergence of gradient em on multi-component mixture of gaussians
Bowei Yan, Mingzhang Yin, and Purnamrita Sarkar · 2017
Later among the works it cites.
On semidefinite relaxations for the block model
Arash A. Amini and Elizaveta Levina · 2018
Later among the works it cites.
Random laplacian matrices and convex relaxations
Afonso S. Bandeira · 2018
Later among the works it cites.
Information-theoretic bounds and phase transitions in clustering, sparse pca, and submatrix localization
J. Banks, C. Moore, R. Vershynin, N. Verzelen, and J. Xu · 2018
Later among the works it cites.
Singularity, misspecification, and the convergence rate of em
Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Michael I. Jordan, Martin J. Wainwright, and Bin Yu · 2018
Later among the works it cites.
Hidden integrality of sdp relaxation for sub-gaussian mixture models
Yingjie Fei and Yudong Chen · 2018
Later among the works it cites.
Partial recovery bounds for clustering with the relaxed k k means
Christophe Giraud and Nicolas Verzelen · 2018
Later among the works it cites.
Convex relaxation methods for community detection
Xiaodong Li, Yudong Chen, and Jiaming Xu · 2018
Later among the works it cites.
High-Dimensional Probability: An Introduction with Applications in Data Science
Roman Vershynin · 2018
Later among the works it cites.
Statistical problems with planted structures: Information-theoretical and computational limits
Yihong Wu and Jiaming Xu · 2018
Later among the works it cites.
Challenges with em in application to weakly identifiable mixture models
Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Michael I. Jordan, Martin J. Wainwright, and Bin Yu · 2019
Later among the works it cites.
Sharp optimal recovery in the two component gaussian mixture model
Mohamed Ndaoud · 2019
Later among the works it cites.
Yihong Wu and Harrison Zhou · 2019
Later among the works it cites.
Diffusion k k -means clustering on manifolds: provable exact recovery via semidefinite relaxations
Xiaohui Chen and Yun Yang · 2020
Closest in time.
Hanson-wright inequality in hilbert spaces with application to k k -means clustering for non-euclidean data
Xiaohui Chen and Yun Yang · 2021
Closest in time.