Genetic Algorithm-Based Clustering and Its New Mutation Operator

  • Arit Thammano
  • Uraiwan Kakulphimp
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4113)


This paper proposes an extension to the original GA-clustering algorithm by introducing a new way to mutate the chromosome. The new mutation operator takes the previous values of the chromosome into account when mutating the chromosome. The superiority of the proposed approach over the original GA-clustering algorithm and K-means algorithm is demonstrated by using 6 benchmark data sets.


Cluster Center Mutation Operator Numerical Attribute Propose Algorithm Initial Cluster Center 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2001)Google Scholar
  2. 2.
    Maulik, U., Bandyopadhyay, S.: Genetic Algorithm-based Clustering Technique. Pattern Recognition 33, 1455–1465 (2000)CrossRefGoogle Scholar
  3. 3.
    Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases: http:// University of California, Department of Information and Computer Science. (1998) Google Scholar
  4. 4.
    Statlog Project Datasets: (2003) Google Scholar
  5. 5.
    Deterding, D.H.: Speaker Normalization for Automatic Speech Recognition. Ph.D. Dissertation. (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Arit Thammano
    • 1
  • Uraiwan Kakulphimp
    • 1
  1. 1.Computational Intelligence Laboratory, Faculty of Information TechnologyKing Mongkut’s Institute of Technology LadkrabangBangkokThailand

Personalised recommendations