Recovery guarantees for exemplar-based clustering
From MaRDI portal
Publication:897656
DOI10.1016/j.ic.2015.09.002zbMath1333.62165arXiv1309.3256OpenAlexW2167930540MaRDI QIDQ897656
Publication date: 7 December 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3256
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear programming (90C05) Boolean programming (90C09)
Related Items (9)
Local Versions of Sum-of-Norms Clustering ⋮ Probably certifiably correct \(k\)-means clustering ⋮ Discrete facility location in machine learning ⋮ \(k\)-median: exact recovery in the extended stochastic ball model ⋮ Clustering subgaussian mixtures by semidefinite programming ⋮ Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization ⋮ Convex optimization for the densest subgraph and densest submatrix problems ⋮ Exact Clustering of Weighted Graphs via Semidefinite Programming ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Algorithm AS 136: A K-Means Clustering Algorithm
- Guaranteed clustering and biclustering via semidefinite programming
- A spectral algorithm for learning mixture models
- Correlation clustering
- NP-hardness of Euclidean sum-of-squares clustering
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Efficiently learning mixtures of two Gaussians
- Learning Mixtures of Gaussians in High Dimensions
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- On the Complexity of Some Common Geometric Location Problems
- Approximation Algorithms for Metric Facility Location Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- A new greedy approach for facility location problems
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- A new partitioning around medoids algorithm
- Local Search Heuristics for k-Median and Facility Location Problems
- Least squares quantization in PCM
- Random Projection Trees for Vector Quantization
- Learning mixtures of arbitrary gaussians
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- A Binary Variable Model for Affinity Propagation
- Learning Theory
- Learning Theory
- Approximating k-median via pseudo-approximation
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: Recovery guarantees for exemplar-based clustering
