Open Access Open Access  Restricted Access Subscription or Fee Access

An Efficient Algorithm for Solving Data Clustering Problems

K. Karthika, Dr.G. Komarasamy


This paper presents a new data clustering algorithm called KPSO algorithm, a combination on K-means and Particle swarm Optimization algorithms. Unlike traditional K-means method, KPSO need not specify the number of clusters to be given prior the clustering process and is able to find the optimal number of clusters during the clustering process. In each and every iteration of KPSO, a discrete PSO is used to optimize the number of clusters with which the K-means is used to find the best clustering result.


Data Clustering, K-Means, Particle Swarm Optimization, Clustering Process.

Full Text:



Davies, DZ & Bouldin, DW, 1979, “A cluster separation measure.”, IEEE transactions on pattern analysis and machine intelligence, Vol. 1, No. 2.

Eberhart, RC & Shi, Y, 2001, “Particle swarm optimization: developments, applications and resources” Proc. IEEE Int. Conf. On Evolutionary Computation, pp. 81-86.

Han, J & Kamber, M, 2001, “Data mining: Concepts and Techniques.” San Francisco: Morgan Kaufmann Publisher.

Jarbouri, BZ & Siarry, P, 2007, “Combinatorial particle swarm optimization for partitional clustering problem.” Vol. 192, pp. 337-345.

Keshav Kousik & Vikram Arora, 2015, ”Hybrid data clustering using firefly based improved genetic algorithm”, vol. 58, pp. 249-256.

Merwe, DW & A. P. Engelbrecht, 2003, “Data clustering using particle swarm optimization.” Proceedings of IEEE congress on Evolutionary Computation, pp. 215-220.

Min Li, Lei Wang, Shaobao Den, 2014, “Hierarchical clustering algorithm for categorical data Using probabilistic roughest model”

Mohan, CK & Al-Kazemi, B, 2001, “Discrete particle swarm optimization. Proceedings of the workshop on particle swarm optimization.” Indianapolis, IN: Purdue school of Engineering and Technoogy, IUOUI (in press).

Parsopoulous, KE, Plagianakos, VP, Magoulas, GD, 2001, “Stretching technique for obtaining global minimizers through particle swarm optimization.” Proceedings of the workshop on particle swarm optimization. Indianapolis, IN: Purdue school of Engineering and technology, IUPUI (in press).

Paterlini, S & Krink, T, 2006, “Differential evolution and particle swarm optimization in partitional clustering,” Comput. Stat. Data Anal. Vol. 3, No. 1, pp. 1-27.

Selim & Ismail, MA, 1984, “K-means type algorithm: generalized convergence theorem and characterization of local optimality”, IEEE Trans. Pattern Anal. Mach. Intell. Vol. 6, pp. 81-87.

Shi, Y & Eberhart, R, 2000, “Experimental study of particle swarm optimization,” Proc. Congress on Evolutionary computation, Seoul, Korea. Piscataway, NJ: IEEE Service center. (In press).

UCI repository of machine learning databases retrieved from the world wide web.

Van den Bergh, F & Engelbretch, AP, 2004, “A Cooperative Approach to Particle Swarm Optimization”, IEEE Transactions on Evolutionary Computation, pp. 225-239.

Xiao, X, Dow, E, Eberhart, R, Ben Miled, Z, Oppelt, RJ, Gene clustering using self-organizing maps and particle swarm optimization, in: proceedings of second IEEE International workshop on high performance computational biology, Nice, France, 2003.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.