K-Means clustering algorithm-伪代码

algorithm: k-means. The k-means algorithm for partitioning, where each cluster’s center is represented by the mean value of the objects in the cluster.

Input:

• k: the number of clusters
• d: a data set containing n objects

Output: a set of k clusters

Method:

(1) arbitrarily choose k objects from D as the initial cluster centers;
(2) repeat
(3) 	(re)assign each object to the cluster to which the object is the most similar, 
			based on the mean value of the objects in the cluster;
(4) 	update the cluster means, that is, 
			calculate the mean value of the objects for  each other
(5) until no change;

来源：Chapter 2.3 Cluster