Clustering by Scale-Space Filtering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Performance Evaluation of Some Clustering Algorithms and Validity Indices
IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering Validity Assessment: Finding the Optimal Partitioning of a Data Set
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
FGKA: a Fast Genetic K-means Clustering Algorithm
Proceedings of the 2004 ACM symposium on Applied computing
A Dynamic Clustering Algorithm Based on PSO and Its Application in Fuzzy Identification
IIH-MSP '06 Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia
WAIMW '06 Proceedings of the Seventh International Conference on Web-Age Information Management Workshops
A genetic algorithm that exchanges neighboring centers for k-means clustering
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
A hybrid quantum-inspired genetic algorithm for flow shop scheduling
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Nonparametric genetic clustering: comparison of validity indices
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
AHSPeR: adaptive hypermedia system oriented toward personalization of readings plans
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
ICE - Intelligent Clustering Engine: A clustering gadget for Google Desktop
Expert Systems with Applications: An International Journal
A new grouping genetic algorithm for clustering problems
Expert Systems with Applications: An International Journal
Improvements to the quantum evolutionary clustering
International Journal of Data Analysis Techniques and Strategies
Hi-index | 12.06 |
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.