When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194): Difference between revisions

@@ Property / cites work @@
+Learning Theory
@@ Property / cites work: Learning Theory / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+On semidefinite relaxations for the block model
@@ Property / cites work: On semidefinite relaxations for the block model / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed Analysis of the k-Means Method
@@ Property / cites work: Smoothed Analysis of the k-Means Method / rank @@
+Normal rank
@@ Property / cites work @@
+Relax, No Need to Round
@@ Property / cites work: Relax, No Need to Round / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Spectral-Norm Bounds for Clustering
@@ Property / cites work: Improved Spectral-Norm Bounds for Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Modern Convex Optimization
@@ Property / cites work: Lectures on Modern Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Centroidal Voronoi Tessellations: Applications and Algorithms
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+Normal rank
@@ Property / cites work @@
+Probably certifiably correct \(k\)-means clustering
+Normal rank
@@ Property / cites work @@
+Spectral Algorithms
@@ Property / cites work: Spectral Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
+Normal rank
@@ Property / cites work @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar k-Means Problem is NP-Hard
@@ Property / cites work: The Planar k-Means Problem is NP-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering subgaussian mixtures by semidefinite programming
+Normal rank
@@ Property / cites work @@
+Approximating K‐means‐type Clustering via Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
+Normal rank
@@ Property / cites work @@
+User-friendly tail bounds for sums of random matrices
+Normal rank
@@ Property / cites work @@
+\(k\)-means requires exponentially many iterations even in the plane
+Normal rank
@@ Property / cites work @@
+A spectral algorithm for learning mixture models
@@ Property / cites work: A spectral algorithm for learning mixture models / rank @@
+Normal rank
@@ Property / cites work @@
+Q5691079
@@ Property / cites work: Q5691079 / rank @@
+Normal rank
@@ Property / cites work @@
+SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
+Normal rank
@@ Property / cites work @@
+A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
+Normal rank