DocumentCode
3022601
Title
A New Algorithm for Clustering Based on Particle Swarm Optimization and K-means
Author
Dong, Jinxin ; Qi, Minyong
Author_Institution
Coll. of Comput. Sci., Liaocheng Univ., Liaocheng, China
Volume
4
fYear
2009
fDate
7-8 Nov. 2009
Firstpage
264
Lastpage
268
Abstract
Clustering is a technique that can divide data objects into meaningful groups. Particle swarm optimization is an evolutionary computation technique developed through a simulation of simplified social models. K-means is one of the popular unsupervised learning clustering algorithms. After analyzing particle swarm optimization and K-means algorithm, a new hybrid algorithm based on both algorithms is proposed. In the new algorithm, the next solution of the problem is generated by the better one of PSO and K-means but not PSO itself. It can make full use of the advantages of both algorithms, and can avoid shortcomings of both algorithms. The experimental results show the effectiveness of the new algorithm.
Keywords
particle swarm optimisation; pattern clustering; unsupervised learning; K-means algorithm; evolutionary computation technique; particle swarm optimization; simplified social models; unsupervised learning clustering algorithms; Artificial intelligence; Clustering algorithms; Computational intelligence; Computational modeling; Computer science; Educational institutions; Evolutionary computation; Particle swarm optimization; Partitioning algorithms; Unsupervised learning; K-means; clustering; particle swarm optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-3835-8
Electronic_ISBN
978-0-7695-3816-7
Type
conf
DOI
10.1109/AICI.2009.394
Filename
5376357
Link To Document