Adaptive Population of Gaussian Dynamic PSO Clustering Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    The key issue in Clustering is the definition of similarity between samples and the evaluation of pros and cons of clustering effects. PSO algorithm has drawn more attention from the majority of researchers for its preferable impact. This paper gives a new function that measures the effectiveness of the clustering algorithm and analyzes it thoroughly. In addition, from the topology of the PSO, an adaptive population of Gaussian dynamic PSO clustering algorithm is proposed based on the Gaussian dynamic algorithm. The experiment shows the measure function could effectively evaluate the pros and cons of clustering effects, and its corresponding algorithm has good clustering efficiency, better performance in the high-dimensional data.

    Reference
    Related
    Cited by
Get Citation

沈亮,常新功,景丽荣.自适应种群的高斯动态粒子群聚类算法①.计算机系统应用,2010,19(8):112-116

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