Improved Spectral-Norm Bounds for Clustering
From MaRDI portal
Publication:3167383
DOI10.1007/978-3-642-32512-0_4zbMath1358.68220arXiv1206.3204OpenAlexW1520260139MaRDI QIDQ3167383
Publication date: 2 November 2012
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3204
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (11)
Iterative algorithm for discrete structure recovery ⋮ Impact of regularization on spectral clustering ⋮ Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering ⋮ Clustering High-Dimensional Data via Feature Selection ⋮ Efficient, certifiably optimal clustering with applications to latent variable graphical models ⋮ Unnamed Item ⋮ Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics ⋮ When do birds of a feather flock together? \(k\)-means, proximity, and conic programming ⋮ A Performance Guarantee for Spectral Clustering ⋮ Consistency of spectral clustering in stochastic block models ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
This page was built for publication: Improved Spectral-Norm Bounds for Clustering
