BibSonomy :: publication :: k-means++: the advantages of careful seeding
URLDOITeX

k-means++: the advantages of careful seeding

David Arthur, and Sergei Vassilvitskii. SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, page 1027--1035. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2007)

Links and resources

BibTeX key:1283494
internal link:
?
You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.
search on:

Comments or reviews  
(0)

There is no review or comment yet. You can write one!

Tags

  • Last update 5 years and 5 months ago.
  • Created 5 years and 10 months ago.

Cite this publication

k-means++: the advantages of careful seeding

David Arthur, and Sergei Vassilvitskii. SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, page 1027--1035. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2007)