k-means++: The advantages of careful seeding

Record

Authors
Arthur, D.; Vassilvitskii, S.
Year
2007
Title
k-means++: The advantages of careful seeding
Published in
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Pages
1027–1035
Type
Conference paper
Our note
none yet
Verification
matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W2073459066 · DOI 10.5555/1283383.1283494
Id
arthur-2007-k-means-advantages-careful-seeding

Cited on

As cited

The pages cite this work in one form.

  • Arthur, D., and Vassilvitskii, S. (2007). k-means++: The advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1027–1035.

BibLaTeX

@inproceedings{arthur-2007-k-means-advantages-careful-seeding,
  author = {Arthur, D. and Vassilvitskii, S.},
  title = {{k-means++: The advantages of careful seeding}},
  booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
  date = {2007},
  pages = {1027--1035}
}

Download · JSON with CSL-JSON · the whole bibliography