Skip to content

k-means++: the advantages of careful seeding

David Arthur, Sergei Vassilvitskii

2007 · 7,398 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Arthur, D., & Vassilvitskii, S. (2007). k-means++: the advantages of careful seeding. 1027–1035. https://doi.org/10.5555/1283383.1283494

In text: (Arthur & Vassilvitskii, 2007)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

The k-means method is a widely used clustering technique that seeks to minimize the average squared distance between points in the same cluster. Although it offers no accuracy guarantees, its simplicity and speed are very appealing in practice. By augmenting k-means with a simple, randomized seeding technique, we obtain an algorithm that is O(log k)-competitive with the optimal clustering. Experiments show our augmentation improves both the speed and the accuracy of k-means, often quite dramatically. 1

  1. Hierarchical Grouping to Optimize an Objective Function1963
  2. Normalized cuts and image segmentation2000
  3. Data clustering1999
  4. Mean shift: a robust approach toward feature space analysis2002
  5. Finite Mixture Models2000

Metadata from OpenAlex (CC0). Citations are generated from the published record.