K-means算法是集简单和经典于一身的基于距离的聚类算法
采用距离作为相似性的评价指标，即认为两个对象的距离越近，其相似度就越大。
该算法认为类簇是由距离靠近的对象组成的，因此把得到紧凑且独立的簇作为最终目标。(K-means algorithm is a distance based clustering algorithm which is simple and classic.
Distance is used as a similarity evaluation index, that is, the closer the distance between the two objects is, the greater the similarity is.
The algorithm considers that clusters are composed of objects close to each other. Therefore, a compact and independent cluster is the ultimate goal.)