首页    期刊浏览 2024年12月03日 星期二
登录注册

文章基本信息

  • 标题:A Genetic K-means Clustering Algorithm Based on the Optimized Initial Centers
  • 本地全文:下载
  • 作者:Min Feng ; Zhenyan Wang
  • 期刊名称:Computer and Information Science
  • 印刷版ISSN:1913-8989
  • 电子版ISSN:1913-8997
  • 出版年度:2011
  • 卷号:4
  • 期号:3
  • 页码:88
  • DOI:10.5539/cis.v4n3p88
  • 出版社:Canadian Center of Science and Education
  • 摘要:

    An optimized initial center of K-means algorithm(PKM) is proposed, which select the k furthest distance data in the high-density area as the initial cluster centers. Experiments show that the algorithm not only has a weak dependence on the initial data, but also has fast convergence and high clustering quality. To obtain effective cluster and accurate cluster, we combine the optimized K-means algorithm(PKM) and genetic algorithm into a hybrid algorithm (PGKM). It can not only improve compactness and separation of the algorithm but also automatically search for the best cluster number k, then cluster after optimizing the k-centers. The optimal cluster is not obtained until terminal conditions are met after continuously iterating. Experiments show that the algorithm has good cluster quality and overall performance.

国家哲学社会科学文献中心版权所有