Description: The basic idea of KMeans algorithm is that the initial random given K cluster centers, according to the nearest neighbor principle, the sample points are divided into different clusters. Then, the centroid of each cluster is computed by the averaging method, so a new cluster centroid is determined. Iterate until the heart of the cluster moves at a distance less than a given value.
To Search:
File list (Check if you may need any files):
kMeans.py
Download