An Improved Two-Phase GAI Particle Swarm Optimization Data Clustering Algorithm


Article Preview

The well-known k-means algorithm that has been successfully applied to many practical clustering problems, suffers from several drawbacks due to its choice of initializations. In order to overcome k-means shortcomings, hybrid algorithms involving evolutionary algorithms are a good option for boosting the clustering performance. In this study, a hybrid two-phase algorithm for data clustering is proposed. In the first phase we utilize the new genetically improved PSO algorithm (GAI-PSO) which combines the standard velocity and position update rules of PSOs with the ideas of selection, mutation and crossover from GAs. The GAI-PSO algorithm searches the solution space to find an optimum initial seed for the next phase. The second phase is a local refining stage utilizing the k-means algorithm which can efficiently converge to the optimum solution.



Advanced Materials Research (Volumes 490-495)

Edited by:

Ran Chen and Wen-Pei Sung




Q. F. Liu, "An Improved Two-Phase GAI Particle Swarm Optimization Data Clustering Algorithm", Advanced Materials Research, Vols. 490-495, pp. 1431-1435, 2012

Online since:

March 2012





[1] A. Ahmad and L. Dey, A k-mean Clustering Algorithm for Mixed Numeric and Categorical data, Data & Knowledge Engineering, Vol. 63 (2): pp.503-527, (2009).


[2] U. Maulik, and S. Bandyopadhyay, Genetic Algorithm-Based Clustering Technique, Pattern Recognition, Vol. 33: pp.1455-1465, (2010).


[3] Y. Kao and K. Cheng, An ACO-Based Clustering Algorithm, M. Dorigo et al. (Eds. ): ANTS 2006, Lecture Notes in Computer Science, Vol. 4150: p.340–347, Springer, (2006).


[4] P. S. Shelokar, V. K. Jayaraman, and B. D. Kulkarni, An ant colony approach for clustering, Analytica Chimica Acta Vol. 509(2): pp.187-195, (2004).