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

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.

Comments or reviews  

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


Cite this publication