k-means 算法 step1 初始化K个质心 step2 将所有的点分配给最近的质心 step3 更新质心 step4 若质心都没用变化,则停止,否则返回step2 -k-means algorithm is initialized step1 step2 K a center of mass of all the points assigned to the nearest centroid centroid step3 step4 update no us

基改进的K-means聚类算法对已知初始聚类中心，对质心点进行求解，并考虑到不同点的权重问题。-Base Improved K-means clustering algorithm known initial cluster centers, centroid point is solved, taking into account the different points of the right to re-issue.