By Topic

K-means Multiple Clustering Research Based on Pseudo Parallel Genetic Algorithm

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
$31 $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)
Ge Xiufeng ; Comput. Software & Theor., Liaoning Tech. Univ., Huludao, China ; Xing Changzheng

As K-means Clustering Algorithm is sensitive to the choice of the initial cluster centers and it is difficult to determine the cluster number and it is easy to be impacted by isolated points, propose the K-means multiple Clustering Method Based on Pseudo Parallel Genetic Algorithm. In the method, adopt the strategy of Variable-Length Chromosome real-coded. Through the introduction of chromosome retreading and focusing operator, K-means algorithm can be perfectly combined with pseudo-parallel genetic algorithm. For the dynamic and directed adjustment of migration rate with the evolutionary process, we have improved the migration rate of PPGA. The results of repeated experiment show that the method can effectively solve the previous problem and it is a practical and effective clustering algorithm.

Published in:

Information Technology and Applications (IFITA), 2010 International Forum on  (Volume:1 )

Date of Conference:

16-18 July 2010