Description: An efficient implementation of the k-means++ algorithm for clustering multivariate data. It has been shown that this algorithm has an upper bound for the expected value of the total intra-cluster distance which is log(k) competitive. Additionally, k-means++ usually converges in far fewer than vanilla k-means.
To Search:
File list (Check if you may need any files):
kmeans.m
license.txt
readmeq.txt
Download