期刊
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A
卷 10, 期 4, 页码 512-519出版社
ZHEJIANG UNIV PRESS
DOI: 10.1631/jzus.A0820196
关键词
Simulated annealing (SA); Data clustering; Hybrid evolutionary optimization algorithm; K-means clustering; Particle swarm optimization (PSO)
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据