DocumentCode
3351279
Title
Finding the optimal number of clusters using genetic algorithms
Author
Liu, Yongguo ; Ye, Mao ; Peng, Jun ; Wu, Hong
Author_Institution
Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu
fYear
2008
fDate
21-24 Sept. 2008
Firstpage
1325
Lastpage
1330
Abstract
In clustering analysis, many methods require the designer to provide the number of clusters. Unfortunately, the designer has no idea, in general, about this information beforehand. In this paper, we propose a genetic algorithm based clustering method called automatic genetic clustering for unknown K (AGCUK). The AGCUK algorithm is able to automatically provide the number of clusters and find the clustering partition. The Davies-Bouldin index is employed to measure the validity of the clusters. Experimental results on artificial and real-life data sets are given to illustrate the effectiveness of the AGCUK algorithm.
Keywords
genetic algorithms; pattern clustering; Davies-Bouldin index; automatic genetic clustering for unknown K; clusters optimal number; genetic algorithms; Algorithm design and analysis; Biological cells; Clustering algorithms; Clustering methods; Computer science; Design engineering; Genetic algorithms; Genetic engineering; Laboratories; Partitioning algorithms; Davies-Bouldin index; clustering; genetic algorithms; noising method;
fLanguage
English
Publisher
ieee
Conference_Titel
Cybernetics and Intelligent Systems, 2008 IEEE Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-1673-8
Electronic_ISBN
978-1-4244-1674-5
Type
conf
DOI
10.1109/ICCIS.2008.4670864
Filename
4670864
Link To Document