Automatic clustering using genetic algorithms |
| |
Authors: | Yongguo Liu Xindong WuYidong Shen |
| |
Institution: | a School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, PR China b State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100191, PR China c Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, PR China d Department of Computer Science, University of Vermont, Burlington, VT 05405, USA |
| |
Abstract: | In face of the clustering problem, many clustering methods usually require the designer to provide the number of clusters as input. Unfortunately, the designer has no idea, in general, about this information beforehand. In this article, we develop a genetic algorithm based clustering method called automatic genetic clustering for unknown K (AGCUK). In the AGCUK algorithm, noising selection and division-absorption mutation are designed to keep a balance between selection pressure and population diversity. In addition, the Davies-Bouldin index is employed to measure the validity of clusters. Experimental results on artificial and real-life data sets are given to illustrate the effectiveness of the AGCUK algorithm in automatically evolving the number of clusters and providing the clustering partition. |
| |
Keywords: | Clustering Genetic algorithms Noising method Davies-Bouldin index K-means algorithm |
本文献已被 ScienceDirect 等数据库收录! |
|