Abstract: Concerning the initial clustering center generation and the data similarity judgment basis of the traditional K-means algorithm, the paper proposed an accurate property weighted K-means clustering algorithm based on information entropy to further improve the clustering accuracy. First, property weights were determined by using entroy method to correct the Euclidean distance. And then, high-quality initial clustering center was chosen by comparing the empowering target cost function of the initial clusters for more accurate and more stable clustering. Finally, the algorithm was implemented in Matlab. The experimental results show that the algorithm accuracy and stability are significantly higher than the traditional K-means algorithm.

Key words: K-means, accuracy, information entropy, property weight, initial clustering center

摘要： 为了进一步提高聚类的精确度，针对传统K-means算法的初始聚类中心产生方式和数据相似性判断依据，提出一种基于信息熵的精确属性赋权K-means聚类算法。首先利用熵值法对数据对象的属性赋权来修正对象间的欧氏距离，然后通过比较初聚类的赋权类别目标价值函数，选择高质量的初始聚类中心来进行更高精度和更加稳定的聚类，最后通过Matlab编程实现。实验证明该算法的聚类精确度和稳定性要明显高于传统K-means算法。

关键词: K-means, 精确度, 信息熵, 属性赋权, 初始聚类中心