Abstract: In many applications, many datasets have the features of both numeric and categorical data, the k-prototype is one of the most important algorithms designed for clustering this type data. Based on the studying of the existing clustering algorithms for mixed data, it proposes a new algorithm for the clustering of mixed data, not only modifies the method of the searching of prototypes, but also designs a new measurement of similarity to measure the similarity between data objects. It also proposes a new method that different from k-prototype to allocate data to prototype. It uses the idea similar to the agglomerate clustering in hierarchical clustering to clustering, after the testing on four real mixed datasets it is found that compared with other algorithms, the proposed algorithm not only can improve the accuracy of clustering, but also has the very high stability.

Key words: clustering, mixed data, similarity measure, hierarchical clustering

摘要： 在许多应用中，很多数据集都具有数值型和分类型数据的混合特征，k-prototype是针对这类数据聚类的经典方法之一，该方法是一种基于k-means和k-mode的聚类方法。在研究了现有的混合属性数据聚类方法之后，引入了一种新算法用于混合型数据聚类，不仅改进了prototype的选取方法，而且提出了一种新的针对混合型数据的相似度度量方式，基于此又提出了一种不同于k-prototype的数据到prototype的分配方式，采用类似层次聚类中凝聚聚类的思想进行聚类，通过在四个真实的混合型数据集上测试发现：与传统算法相比，算法提高了聚类的精度和稳定性。

关键词: 聚类, 混合型数据, 相似度计算, 层次聚类