Fetching the paper…
Reading the bibliography…
Given a set of data, one central goal is to group them into clusters based on some notion of similarity between the individual objects.
Least squares quantization in PCM
S. Lloyd · 1982
Earlier work this paper cites.
k-means-type algorithms: A generalized convergence theorem and characterization of local optimality
S. Z. Selim and M. A. Ismail · 1984
Earlier work this paper cites.
Matrix Computations
G. H. Golub and C. F. Van Loan · 1996
Earlier work this paper cites.
Primal-Dual Interior-Point Methods
S. J. Wright · 1997
Earlier work this paper cites.
Learning mixtures of gaussians
S. Dasgupta · 1999
Earlier work this paper cites.
Centroidal Voronoi tessellations: Applications and algorithms
Q. Du, V. Faber, and M. Gunzburger · 1999
Earlier work this paper cites.
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
A. Ben-Tal and A. Nemirovski · 2001
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
A spectral algorithm for learning mixture models
S. Vempala and G. Wang · 2004
Earlier work this paper cites.
On spectral learning of mixtures of distributions
D. Achlioptas and F. McSherry · 2005
Earlier work this paper cites.
Approximating k-means-type clustering via semidefinite programming
J. Peng and Y. Wei · 2007
Cited alongside, same era.
NP-hardness of Euclidean sum-of-squares clustering
D. Aloise, A. Deshpande, P. Hansen, and P. Popat · 2009
Cited alongside, same era.
Spectral algorithms
R. Kannan, S. Vempala, et al · 2009
Cited alongside, same era.
The planar k-means problem is NP-hard
M. Mahajan, P. Nimbhorkar, and K. Varadarajan · 2009
Cited alongside, same era.
Clustering with spectral norm and the k-means algorithm
A. Kumar and R. Kannan · 2010
Cited alongside, same era.
A Newton-CG augmented Lagrangian method for semidefinite programming
X.-Y. Zhao, D. Sun, and K.-C. Toh · 2010
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2012
Later among the works it cites.
Relax, no need to round: Integrality of clustering formulations
P. Awasthi, A. S. Bandeira, M. Charikar, R. Krishnaswamy, S. Villar, and R. Ward · 2015
Later among the works it cites.
On the tightness of an SDP relaxation of k-means
T. Iguchi, D. G. Mixon, J. Peterson, and S. Villar · 2015
Later among the works it cites.
SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
L. Yang, D. Sun, and K.-C. Toh · 2015
Later among the works it cites.
Statistical and computational guarantees of Lloyd’s algorithm and its variants
Y. Lu and H. H. Zhou · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Arthur, B. Manthey, and H. Röglin · 2011
Cited alongside, same era.
k-means requires exponentially many iterations even in the plane
A. Vattani · 2011
Cited alongside, same era.
Improved spectral-norm bounds for clustering
P. Awasthi and O. Sheffet · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Cited alongside, same era.
Probably certifiably correct k-means clustering
T. Iguchi, D. G. Mixon, J. Peterson, and S. Villar · 2017
Closest in time.
Clustering subgaussian mixtures by semidefinite programming
D. G. Mixon, S. Villar, and R. Ward · 2017
Closest in time.
On semidefinite relaxations for the block model
A. A. Amini and E. Levina · 2018
Closest in time.
S. Ling and T. Strohmer · 2018
Closest in time.