说明：  k-means 算法接受输入量 k ；然后将n个数据对象划分为 k个聚类以便使得所获得的聚类满足：同一聚类中的对象相似度较高；而不同聚类中的对象相似度较小。聚类相似度是利用各聚类中对象的均值所获得一个“中心对象”（引力中心）来进行计算的。 Matlab 源代码，以兰花数据集作为测试对象。
(k-means algorithm to accept input k then n data object is divided into k-clustering in order to make available to the cluster to meet: the same objects in clustering high similarity and objects in different clustering the similarity smaller. Cluster similarity is the use of the clustering of objects by means of a )