Arthur, D. & Vassilvitskii, S.
(2007):
k-means++: the advantages of careful seeding.
In: SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms,
Philadelphia, PA, USA.
[BibTeX][Endnote]
@inproceedings{1283494,
author = {Arthur, David and Vassilvitskii, Sergei},
title = {k-means++: the advantages of careful seeding},
booktitle = {SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
year = {2007},
pages = {1027--1035},
isbn = {978-0-898716-24-5},
keywords = {algorithm, careful, clustering, inex08paper, kmeans, kmeans++, paper, seeding}
}
%0 = inproceedings
%A = Arthur, David and Vassilvitskii, Sergei
%B = SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
%C = Philadelphia, PA, USA
%D = 2007
%I = Society for Industrial and Applied Mathematics
%T = k-means++: the advantages of careful seeding