热门
a genetic algorithm with gene rearrangement for k-means clustering
文献类型:期刊论文
作者 | Chang Dong-Xia ; Zhang Xian-Da ; Zheng Chang-Wen |
刊名 | PATTERN RECOGNITION
![]() |
出版日期 | 2009 |
卷号 | 42期号:7页码:1210-1222 |
关键词 | Clustering Evolutionary computation Genetic algorithms K-means algorithm Remote sensing image |
ISSN号 | 0031-3203 |
学科主题 | Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic |
收录类别 | SCI,EI,ACM,SCIENCEDIRECT |
语种 | 英语 |
WOS记录号 | WOS:000265365500002 |
公开日期 | 2011-03-18 |
附注 | In this paper, a new clustering algorithm based on genetic algorithm (GA) with gene rearrangement (GAGR) is proposed, which in application may effectively remove the degeneracy for the purpose of a more efficient search. A new crossover operator that exploits a measure of similarity between chromosomes in a population is also presented. Adaptive probabilities of crossover and mutation are employed to prevent the convergence of the GAGR to a local optimum. Using the real-world data sets, we compare the performance of our GAGR clustering algorithm with K-means algorithm and other GA methods. An application of the GAGR clustering algorithm in unsupervised classification of multispectral remote sensing images is also provided. Experiment results demonstrate that the GAGR clustering algorithm has high performance, effectiveness and flexibility. (C) 2008 Elsevier Ltd. All rights reserved. |
源URL | [http://124.16.136.157/handle/311060/7962] ![]() |
专题 | 软件研究所_软件所图书馆_2009年期刊/会议论文 |
推荐引用方式 GB/T 7714 | Chang Dong-Xia,Zhang Xian-Da,Zheng Chang-Wen. a genetic algorithm with gene rearrangement for k-means clustering[J]. PATTERN RECOGNITION,2009,42(7):1210-1222. |
APA | Chang Dong-Xia,Zhang Xian-Da,&Zheng Chang-Wen.(2009).a genetic algorithm with gene rearrangement for k-means clustering.PATTERN RECOGNITION,42(7),1210-1222. |
MLA | Chang Dong-Xia,et al."a genetic algorithm with gene rearrangement for k-means clustering".PATTERN RECOGNITION 42.7(2009):1210-1222. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。