.png){kind=icon}
返回
An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering
.png){kind=icon}
PRE
AI
DOI：10.1631/jzus.A0820196.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the K-means algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.
Keyword:
Simulated annealing (SA)
Data clustering
Hybrid evolutionary optimization algorithm
K-means clustering
Particle swarm optimization (PSO)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.1K
被引数:
4.6K
机构
引用论文
.png){kind=icon}
Comparing SOM neural network with Fuzzy c-means, K-means and traditional hierarchical clustering algorithmsSOM神经网络与模糊c均值、K均值和传统层次聚类算法的比较
PREAI
分享收藏Particle swarm optimization to solving the economic dispatch considering the generator constraints
OAAI
OAAI分享收藏
查看更多内容