Abstract
This paper proposes a novel genetic clustering algorithm, called a dynamic niching quantum genetic clustering algorithm (DNQGA), which is based on the concept and principles of quantum computing, such as the qubits and superposition of states. Instead of binary representation, a boundary-coded chromosome is used. Moreover, a dynamic identification of the niches is performed at each generation to automatically evolve the optimal number of clusters as well as the cluster centers of the data set. After getting the niches of the population, a Q-gate with adaptive selection of the angle for every niches is introduced as a variation operator to drive individuals toward better solutions. Several data sets are used to demonstrate its superiority. The experimental results show that DNQGA clustering algorithm has high performance, effectiveness and flexibility.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Glenn, W.M., Martha, C.C.: An examination of procedures for determining the number of clusters in a data set. Psychometrika 50, 159–179 (1985)
Xuanli, L.X., Gerardo, B.: A validity measure for fuzzy clustering. IEEE Trans. Pattern Anal. Mach. Intell. 13, 841–847 (1991)
Murthy, C.A., Chowdhury, N.: In search of optimal clusters using genetic algorithms. Pattern Recognition Letters 17, 825–832 (1996)
Bandyopdhyay, S., Maulik, U.: An evolutionary technique based on K-Means algorithm for optimal clustering in RN. Information Sciences 146, 221–237 (2002)
Sanghamitra, B., Sriparna, S.: GAPS: A clustering method using a new point symmetry-based distance measure. Pattern Recogn. 40, 3430–3451 (2007)
Chang, D.X., Zhang, X.D., Zheng, C.W.: A genetic algorithm with gene rearrangement for K-means clustering. Pattern Recogn. 42, 1210–1222 (2009)
Ajit, N., Mark, M.: Quantum inspired genetic algorithm. In: Proc. of the Third IEEE International Conference on Evolutionary Computation, pp. 61–66 (1996)
Kuk, H.H.: Genetic quantum algorithm and its application to combinatorial optimization problem. In: Proc. 2000 Congress on Evolutionary Computation, pp. 1354–1360 (2000)
Miin, S.Y., Kuo, L.W.: A similarity-based robust clustering method. IEEE Trans. Pattern Anal. Mach. Intell. 26, 434–448 (2004)
Tony, H.: Quantum computing: an introduction. Computing & Control Engineering Journal, 105–112 (1999)
Kuk, H.H., Jong, H.K.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6, 580–593 (2002)
Yang, M.S., WuK, L.: A similarity-based robust clustering method. IEEE Trans. Pattern Anal. Mach. Intell. 26(4), 434–448 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, D., Zhao, Y. (2011). A Dynamic Niching Quantum Genetic Algorithm for Automatic Evolution of Clusters. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds) Computer Analysis of Images and Patterns. CAIP 2011. Lecture Notes in Computer Science, vol 6855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23678-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-23678-5_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23677-8
Online ISBN: 978-3-642-23678-5
eBook Packages: Computer ScienceComputer Science (R0)