Improvement of the Genetic Algorithm and Its Application on Clustering
This paper proposes an improved genetic algorithm, it keeps the population diversity by similarity checks on the population before selection, and the algorithm solves the early-maturing problem of the population evolution,and proposes a formula for mutation probabifity related with similarity rate and iteration times. The algorithm not only maintains a good diversity of population, but also guarantees the algorithm convergence. Compared to c-means clustering algorithm, the improved genetic algorithm proposed in this paper has been proved its improvement effect by the result of clustering experiments using the UCI datasets of WINE and IRIS.
early maturity population diversify similarity several crossovers adaptive mutation probability
Chen Rui Zou Shurong Zhang Hongwei Feng Zhongtian
Department of Computer, Chengdu University of Information Technology, Chengdu 610225
国际会议
长沙
英文
1575-1577
2010-03-13(万方平台首次上网日期,不代表论文的发表时间)