An Improved Niche Genetic Clustering Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    The traditional genetic algorithm has the shortcomings of premature convergence and slow convergence. This paper adopts improved niche technology to solve this problem. It also uses the specific issues to improve the genetic operators, and the improved niche genetic algorithm is applied to Clustering Mining. As the K-means algorithm in the clustering algorithm for mining has the problem of the selection of the initial value of K-senstive and if we select a different value, it will lead to a different clustering result. It is easy to fall into local optimum. So it will make poor clustering results. Therefore, this article combines the improved niche genetic algorithm with K-means algorithm to produce a new improved algorithm named an improved niche genetic clustering algorithm. It is verified that the algorithm is valid in improving the quality of clustering analysis.

    Reference
    Related
    Cited by
Get Citation

孙红艳,王英博.一种改进的小生境遗传聚类算法.计算机系统应用,2010,19(2):37-40

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 19,2009
  • Revised:
  • 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