K-means Optimization Clustering Algorithm Based on Particle Swarm Optimization and Multi-Groups Merging
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    To deal with the problem of the sensitivity of initialization and premature convergence, this paper proposes a novel K-means optimization clustering algorithm based on particle swarm optimization and multi-groups merging, namely M-PSO-Means. Firstly the algorithm selects the initial cluster center by improving particle swarms clustering algorithm under default number of clustering, then optimizes the clustering, and last carries out cluster merging based on multi-groups merging condition to obtain the best clustering results. The experimental results show that, the algorithm can effectively solve the defects of K-means algorithm, and has a faster convergence rate and better global search ability, as well as better cluster category effect.

    Reference
    Related
    Cited by
Get Citation

林有城,符强,谢文斌,史马杰,童楠.基于多类合并的PSO-means聚类算法.计算机系统应用,2014,23(2):160-165,69

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 12,2013
  • Revised:September 22,2013
  • Adopted:
  • Online: January 27,2014
  • 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