By Topic

A New Clustering Algorithm Based on PSO with the Jumping Mechanism of SA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jinxin Dong ; Coll. of Comput. Sci., Liaocheng Univ., Liaocheng, China ; Minyong Qi

A new clustering algorithm is proposed based on particle swarm optimization (PSO). The main idea of the new algorithm is to solve clustering problem using the fast search ability of the particle swarm optimization, each particle is composed of a cluster center vector, and represents a possible solution of the clustering problem. To escape from local optimum, a new idea is proposed, that is the neighborhood structure of individual optimum is enriched using the probabilistic jumping property of the simulated annealing (SA). The individual optimum of the particles is disturbed randomly, that is the data pattern clustering label is changed randomly, so the search ability of the global space is enhanced. The experimental results on different datasets show that the new algorithm has better performance than particle swarm optimization and K-means algorithm, has better global convergence, and it is an effective clustering algorithm.

Published in:

Intelligent Information Technology Application, 2009. IITA 2009. Third International Symposium on  (Volume:3 )

Date of Conference:

21-22 Nov. 2009