Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Applications》 2007-21
Add to Favorite Get Latest Update

Improved Genetic Algorithm-based clustering approach

LU Lin-hua,WANG Bo College of Computer Science and Engineering,Chongqing University,Chongqing 400044,China  
An improved clustering approach is described in this paper.The traditional K-means algorithm is good at locally searching capability,but it is sensitive to the initialization,easy to get stuck at locally optimal values.The simple genetic algorithm-based clustering method is a global optimize approach,but it is weak at the locally searching capability and convergence speed.Take the problems which exists in the two algorithms into account,a new clustering algorithm is put forwarded in this paper.The new approach integrates the advantages of the two algorithms,which introduces the K-means operation and then utilizes the genetic algorithm to do some optimization and also improved the crossover operation in the genetic algorithm,improves the locally searching capability and convergence speed of the genetic algorithm-based clustering algorithm.
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved