实现聚类，预测数据，在教育行业十分有帮助(The basic idea of KMeans algorithm is that the initial random given K cluster centers, according to the nearest neighbor principle, the sample points are divided into different clusters. Then, the centroid of each cluster is computed by the averaging method, so a new cluster centroid is determined. Iterate until the heart of the cluster moves at a distance less than a given value.)