|
|
|
| Improved Cluster Algorithm Based on K-Means and Particle Swarm Optimization |
| Tao Xin-min①,Xu Jing②,Yang Li-biao①,Liu Yu① |
| ①College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001,China; ②Department of Mathematics and Mechanics, Heilongjiang Institute of Science and Technology, Harbin 150027,China |
|
|
|
|
Abstract To deal with the problem of premature convergence of the traditional K-means algorithm, a novel K-means cluster method based on the enhanced Particle Swarm Optimization(PSO) algorithm is presented. In this approach, the stochastic mutation operation is introduced into the PSO evolution, which reinforces the exploitation of global optimum of the PSO algorithm. In order to avoid the premature convergence and speed up the convergence, traditional K-means algorithm is used to explore the local search space more efficiently dynamically according to the variation of the particle swarm’s fitness variance. Comparison of the performance of the proposed approach with the cluster method based on K-means, traditional PSO algorithm and other PSO-K-means algorithm is experimented. The experimental results show the proposed method can not only effectively solve the premature convergence problem, but also significantly speed up the convergence.
|
|
Received: 15 December 2008
|
|
|
|
Corresponding Authors:
Tao Xin-min
|
|
|
|
|
|
|
2010, Vol. 32 
