Introduction - If you have any usage issues, please Google them yourself
K-mean Algorithm
Initialisation: set seed points
Assign each object to the cluster with the nearest seed point
Compute seed points as the centroids of the clusters of the current partition (the centroid is the centre, i.e., mean point, of the cluster)
Go back to Step 1), stop when no more new assignment
GUI in java Best Proj Devide web log in various clusters