K-means
于 2020-06-19 发布
文件大小:1KB
0 256
下载积分: 1
下载次数: 0
代码说明：
按照最邻近原则把待分类样本点分到各个簇。然后按平均法重新计算各个簇的质心，从而确定新的簇心。一直迭代，直到簇心的移动距离小于某个给定的值。(According to the nearest neighbor principle, the sample points to be classified are divided into clusters. Then the centroid of each cluster is recalculated according to the average method to determine the new cluster center. Iterate until the moving distance of the cluster center is less than a given value)
文件列表：
K-means.m, 3485 , 2019-08-05
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
