实现数据挖掘中的Kmean算法，先确定其中心店，然后再进行计算每个数据点离簇中心的距离，选择其最小的，然后进行迭代-Kmean data mining algorithms to determine its center shop, and then to calculate the distance of each data point the center of the cluster, its minimum, and then iterate