Description: K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.
- [btl_51a] - 51 Baud Rate Setting small calculation t
- [MyKmeans] - achieving K-mean clustering algorithms :
- [program of clustering] - the designation of image pattern recogna
- [k-means1] - k-means clustering, Traditional Chinese
- [TextCategorization] - based on Bayesian algorithms to achieve
- [montecarlo] - this document, including the Monte Carlo
- [cure.c.Rar] - classic cure clustering algorithm, and u
- [KMEANSII] - Neural network in K-means clustering alg
- [K_Means] - k-means is a classical clustering algori
File list (Check if you may need any files):
Download