A quantum-inspired genetic algorithm for k-means clustering

The number of clusters has to be known in advance for the conventional k-means clustering algorithm and moreover the clustering result is sensitive to the selection of the initial cluster centroids. This sensitivity may make the algorithm converge to the local optima. This paper proposes a quantum-inspired genetic algorithm for k-means clustering (KMQGA). In KMQGA, a Q-bit based representation is employed for exploration and exploitation in discrete 0-1 hyperspace using rotation operation of quantum gate as well as the typical genetic algorithm operations (selection, crossover and mutation) of Q-bits. Different from the typical quantum-inspired genetic algorithms (QGA), the length of a Q-bit in KMQGA is variable during evolution. Without knowing the exact number of clusters beforehand, KMQGA can obtain the optimal number of clusters as well as providing the optimal cluster centroids. Both the simulated datasets and the real datasets are used to validate KMQGA, respectively. The experimental results show that KMQGA is promising and effective.

[1]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[3]  Yee Leung,et al.  Clustering by Scale-Space Filtering , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Amit Konar,et al.  Document Clustering Using Differential Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[5]  George Karypis,et al.  A Comparison of Document Clustering Techniques , 2000 .

[6]  Yi Lu,et al.  FGKA: a Fast Genetic K-means Clustering Algorithm , 2004, SAC '04.

[7]  Jong-Hwan Kim,et al.  Face detection using quantum-inspired evolutionary algorithm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[8]  Michael J. Laszlo,et al.  A genetic algorithm that exchanges neighboring centers for k-means clustering , 2007, Pattern Recognit. Lett..

[9]  Pan Ruo-yu,et al.  Optimization Study on k Value of K-means Algorithm , 2006 .

[10]  Ujjwal Maulik,et al.  Performance Evaluation of Some Clustering Algorithms and Validity Indices , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  M. Batouche,et al.  A new quantum-inspired genetic algorithm for solving the travelling salesman problem , 2004, 2004 IEEE International Conference on Industrial Technology, 2004. IEEE ICIT '04..

[12]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[13]  S. Bandyopadhyay,et al.  Nonparametric genetic clustering: comparison of validity indices , 2001, IEEE Trans. Syst. Man Cybern. Syst..

[14]  Xinzhi Liu,et al.  A Dynamic Clustering Algorithm Based on PSO and Its Application in Fuzzy Identification , 2006, 2006 International Conference on Intelligent Information Hiding and Multimedia.

[15]  J. Dunn.  Well-Separated Clusters and Optimal Fuzzy Partitions , 1974 .

[16]  K. Benatchba,et al.  Image segmentation using quantum genetic algorithms , 2006, IECON 2006 - 32nd Annual Conference on IEEE Industrial Electronics.

[17]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[18]  M. Narasimha Murty,et al.  Genetic K-means algorithm , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[19]  Wei Song,et al.  Genetic Algorithm-based Text Clustering Technique: Automatic Evolution of Clusters with High Efficiency , 2006, 2006 Seventh International Conference on Web-Age Information Management Workshops.

[20]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[21]  Tony Hey,et al.  Quantum computing: an introduction , 1999 .

[22]  Michalis Vazirgiannis,et al.  Clustering validity assessment: finding the optimal partitioning of a data set , 2001, Proceedings 2001 IEEE International Conference on Data Mining.