A bad instance for \texttt{k-means++}
From MaRDI portal
Publication:393129
DOI10.1016/J.TCS.2012.02.028zbMATH Open1341.68307OpenAlexW2176996872MaRDI QIDQ393129FDOQ393129
Authors: Tobias Brunsch, Heiko Röglin 
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.028
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Least squares quantization in PCM
- NP-hardness of Euclidean sum-of-squares clustering
- Probability Inequalities for Sums of Bounded Random Variables
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- Clustering to minimize the maximum intercluster distance
- Adaptive Sampling for k-Means Clustering
- \(k\)-means requires exponentially many iterations even in the plane
- The Planar k-Means Problem is NP-Hard
- Smoothed analysis of the \(k\)-means method
- The local nature of list colorings for graphs of high girth
Cited In (10)
- Clustering stability-based evolutionary K-means
- A tight lower bound instance for \(k\)-means++ in constant dimension
- k-means++ under approximation stability
- Tight lower bound instances for \(k\)-means++ in two dimensions
- Approximate Clustering with Same-Cluster Queries
- A bad instance for \(k\)-means++
- Analysis of \(k\)-means++ for separable data
- Noisy, Greedy and Not so Greedy k-Means++
- \(k\)-means++ under approximation stability
- Also for \(k\)-means: more data does not imply better performance
Uses Software
This page was built for publication: A bad instance for \texttt{k-means++}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393129)
