A fast k-means implementation using coresets

  title={A fast k-means implementation using coresets},
  author={Gereon Frahling and Christian Sohler},
  booktitle={Symposium on Computational Geometry},
In this paper we develop an efficient implementation for a k-means clustering algorithm. Our algorithm is a variant of KMHybrid [28, 20], i.e. it uses a combination of Lloyd-steps and random swaps, but as a novel feature it uses coresets to speed up the algorithm. A coreset is a small weighted set of points that approximates the original point set with respect to the considered problem. The main strength of the algorithm is that it can quickly determine clusterings of the same point set for… CONTINUE READING
Highly Cited
This paper has 82 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 55 extracted citations

Deterministic Feature Selection for K-Means Clustering

IEEE Transactions on Information Theory • 2013
View 4 Excerpts
Highly Influenced

Interactive Variability Analysis for Initial Sample Testing of Industrial CT Data

Johanna Schmidt, MASTER’S THESIS, Verfassung der Arbeit
View 3 Excerpts
Highly Influenced

Quantized Compressive K-Means

IEEE Signal Processing Letters • 2018
View 1 Excerpt

Compressive K-means

2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) • 2017
View 1 Excerpt

82 Citations

Citations per Year
Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-3 of 3 references

A local search approximation algorithm for k-means clustering

Symposium on Computational Geometry • 2002
View 8 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…