Genetic Algorithm-Based Clustering and Its New Mutation Operator
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.
KeywordsCluster Center Mutation Operator Numerical Attribute Propose Algorithm Initial Cluster Center
Unable to display preview. Download preview PDF.
- 1.Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2001)Google Scholar
- 3.Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases: http:// www.ics.uci.edu/~mlearn/MLRepository.html. University of California, Department of Information and Computer Science. (1998) Google Scholar
- 4.Statlog Project Datasets: http://www.liacc.up.pt/ML/statlog/datasets/heart/. (2003) Google Scholar
- 5.Deterding, D.H.: Speaker Normalization for Automatic Speech Recognition. Ph.D. Dissertation. (1989)Google Scholar