该算法的目的是将n个点（样本或观测值）聚类为k组，其中每个点都以最近的平均值进行聚类。

The aim of the algorithm is to cluster n points (samples or observations) into k groups in which each point belongs to the cluster with the nearest mean. 

这个过程一直持续到聚类的簇中没有数据变化或者算法已经达到迭代的极限为止。

This process continues until there is no change in the clusters or the algorithm has reached the limit of iteration. 

该算法有3个感兴趣的量：点数、k（簇数）和迭代次数。

The algorithm has 3 values of interest: the number of points, k (number of clusters) and the number of iterations. 

本代码可以让您在每次迭代时观察到集群中数据点的移动。

The code was designed in a way you can watch the movement of the cluster at each iteration. 

有任何问题可以与作者联系，作者邮箱：orramirezba@ittepic.edu.mx

If you are facing any trouble you can contact me by email. 

my email is: orramirezba@ittepic.edu.mx

完整源码下载地址：

http://page3.dfpan.com/fs/7lc3j2321629d1675d7/ 

更多精彩文章请关注微信号：