Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394): Difference between revisions

@@ Property / describes a project that uses @@
+k-means++
@@ Property / describes a project that uses: k-means++ / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963057284
@@ Property / OpenAlex ID: W2963057284 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.11429
@@ Property / arXiv ID: 1806.11429 / rank @@
+Normal rank
@@ Property / cites work @@
+Community Detection and Stochastic Block Models
@@ Property / cites work: Community Detection and Stochastic Block Models / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Recovery in the Stochastic Block Model
@@ Property / cites work: Exact Recovery in the Stochastic Block Model / 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 @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+Q2934696
@@ Property / cites work: Q2934696 / 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 @@
+Random Laplacian matrices and convex relaxations
@@ Property / cites work: Random Laplacian matrices and convex relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
+Normal rank
@@ Property / cites work @@
+Learning Theory
@@ Property / cites work: Learning Theory / 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 @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Spectra of graphs
@@ Property / cites work: Spectra of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5691133
@@ Property / cites work: Q5691133 / rank @@
+Normal rank
@@ Property / cites work @@
+Diffusion maps
@@ Property / cites work: Diffusion maps / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
+Normal rank
@@ Property / cites work @@
+The Rotation of Eigenvectors by a Perturbation. III
+Normal rank
@@ Property / cites work @@
+Q4003026
@@ Property / cites work: Q4003026 / rank @@
+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 @@
+Consistency of spectral clustering in stochastic block models
+Normal rank
@@ Property / cites work @@
+Q4595047
@@ Property / cites work: Q4595047 / rank @@
+Normal rank
@@ Property / cites work @@
+When do birds of a feather flock together? \(k\)-means, proximity, and conic programming
+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 @@
+Spectral clustering and the high-dimensional stochastic blockmodel
+Normal rank
@@ Property / cites work @@
+From graph to manifold Laplacian: the convergence rate
+Normal rank
@@ Property / cites work @@
+Spectral convergence of the connection Laplacian from random samples
+Normal rank
@@ Property / cites work @@
+Q4614130
@@ Property / cites work: Q4614130 / rank @@
+Normal rank
@@ Property / cites work @@
+A variational approach to the consistency of spectral clustering
+Normal rank
@@ Property / cites work @@
+User-friendly tail bounds for sums of random matrices
+Normal rank
@@ Property / cites work @@
+Consistency of spectral clustering
@@ Property / cites work: Consistency of spectral clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4260388
@@ Property / cites work: Q4260388 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3838091
@@ Property / cites work: Q3838091 / rank @@
+Normal rank