Description: K-means clustering algorithm is hard, is a typical prototype-based clustering method on behalf of the objective function, it is a method of data points to a certain distance the prototype as the optimization objective function obtained by the function extremum iteration the adjustment rules.
To Search:
File list (Check if you may need any files):
K_Means\data0.txt
.......\K_Means.java
.......\K_Means源码.txt
K_Means