.png){kind=icon}
返回
Centroid Ratio for a Pairwise Random Swap Clustering Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2013.113.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering algorithm and cluster validity are two highly correlated parts in cluster analysis. In this paper, a novel idea for cluster validity and a clustering algorithm based on the validity index are introduced. A Centroid Ratio is firstly introduced to compare two clustering results. This centroid ratio is then used in prototype-based clustering by introducing a Pairwise Random Swap clustering algorithm to avoid the local optimum problem of k-means. The swap strategy in the algorithm alternates between simple perturbation to the solution and convergence toward the nearest optimum by k-means. The centroid ratio is shown to be highly correlated to the mean square error (MSE) and other external indices. Moreover, it is fast and simple to calculate. An empirical study of several different datasets indicates that the proposed algorithm works more efficiently than Random Swap, Deterministic Random Swap, Repeated k-means or k-means++. The algorithm is successfully applied to document clustering and color image quantization as well.
Keyword:
Data clustering
random /deterministic swap
clustering evaluation
k-means
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
分享收藏
Ultrafiltration to characterize PM2.5 water-soluble iron and its sources in an urban environment
PREAI
分享收藏分享收藏
查看更多内容