k-means

代码说明：

说明：  k均值聚类算法（k-means clustering algorithm）是一种迭代求解的聚类分析算法，其步骤是，预将数据分为K组，则随机选取K个对象作为初始的聚类中心，然后计算每个对象与各个种子聚类中心之间的距离，把每个对象分配给距离它最近的聚类中心。(The k-means clustering algorithm is an iteratively solved clustering algorithm in which the data is pre-divided into K groups, the K objects are randomly selected as the initial clustering center, and then the distance between each object and the seed clustering center is calculated, and each object is assigned to the clustering center closest to it.)

文件列表：

k-means, 0 , 2020-11-08
k-means\Euclidian_distance.m, 646 , 2018-09-13
k-means\test1.m, 1823 , 2018-09-13
k-means\test2.m, 1884 , 2018-09-13