说明：  K均值聚类算法是先随机选取K个对象作为初始的聚类中心。然后计算每个对象与各个种子聚类中心之间的距离，把每个对象分配给距离它最近的聚类中心
(K-means clustering algorithm is to randomly K objects as the initial cluster centers. Then calculate the distance of each object and each seed cluster centers, assigning each object to its distance the nearest cluster center)