.png){kind=icon}
返回
An improved k-prototypes clustering algorithm for mixed numeric and categorical data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.04.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Data objects with mixed numeric and categorical attributes are commonly encountered in real world. The k-prototypes algorithm is one of the principal algorithms for clustering this type of data objects. In this paper, we propose an improved k-prototypes algorithm to cluster mixed data. In our method, we first introduce the concept of the distribution centroid for representing the prototype of categorical attributes in a cluster. Then we combine both mean with distribution centroid to represent the prototype of the cluster with mixed attributes, and thus propose a new measure to calculate the dissimilarity between data objects and prototypes of clusters. This measure takes into account the significance of different attributes towards the clustering process. Finally, we present our algorithm for clustering mixed data, and the performance of our method is demonstrated by a series of experiments on four real-world datasets in comparison with that of traditional clustering algorithms. (c) 2013 Elsevier B.V. All rights reserved.
Keyword:
Clustering
Data mining
Mixed data
Dissimilarity measure
Attribute significance
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Potential Negative Consequences of Adding Phosphorus‐Based Fertilizers to Immobilize Lead in Soil
PREAI
分享收藏
Apply extended self-organizing map to cluster and classify mixed-type data应用扩展自组织映射对混合型数据进行聚类和分类.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏G-ANMI: A mutual information based genetic clustering algorithm for categorical dataG-anmi: 一种基于互信息的分类数据遗传聚类算法
PREAI
分享收藏分享收藏
查看更多内容