kmeans++ clustering (see References) using R's
builtin function kmeans
.
1 
data 
an N \times d matrix, where N are the samples and d is the dimension of space. 
k 
number of clusters. 
start 
first cluster center to start with 
iter.max 
the maximum number of iterations allowed 
nstart 
how many random sets should be chosen? 
... 
additional arguments passed to

Arthur, D. and S. Vassilvitskii (2007). “kmeans++: The advantages of careful seeding.” In H. Gabow (Ed.), Proceedings of the 18th Annual ACMSIAM Symposium on Discrete Algorithms [SODA07], Philadelphia, pp. 10271035. Society for Industrial and Applied Mathematics.
1 2 3 4 5 6 7 8 9 
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
Please suggest features or report bugs with the GitHub issue tracker.
All documentation is copyright its authors; we didn't write any of that.