Description Usage Arguments Value References
Run the k-means++ algorithm n times and return the solution with the smallest loss.
1 | kmeansppn(x, k, n = 10, iter.max = 1000, algorithm = "Lloyd")
|
x |
Data matrix with rows corresponding to data items. |
k |
Number of clusters. |
n |
Number of repeats to run. Optional. Default is 10. |
algorithm |
Clustering algorithm to use. Optional. Default is
|
iter |
The maximum number of iterations. Optional. Default is 1000. |
See documentation for kmeans for details.
Arthur & Vassilivitskii (2007) k-means++: the advantages of careful seeding. In Proc SODA '07, 1027-1035.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.