Optimized K-Means Clustering Analysis Based on Genetic Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    For K-Means clustering algorithm, the k value must be determined in advance and can’t be changed. How- ever, the value is usually not the best if it is determined by experience. In this paper, fitness is taken into account to look for optimal number automatically in the mutation operations. Also, genetic operation is used to select the centers accordingly. In addition, the global optimization capability of genetic algorithm can overcome the locality of K-Means clustering algorithm. The experimental results show that this algorithm has better global searching capability and can efficiently improve the clustering result by adjusting the k value automatically.

    Reference
    Related
    Cited by
Get Citation

胡彧,毕晋芝.遗传优化的K均值聚类算法.计算机系统应用,2010,19(6):52-55

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 10,2009
  • Revised:November 14,2009
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063