Affinity Propagation Algorithm Based on Particle Swarm Optimization
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    Aiming at the problem that the preference parameter and damping parameter in affinity propagation algorithm have limitations to the result of clustering, this paper puts forward an affinity propagation algorithm which based on particle swarm optimization (PSO-AP). By taking the two parameters in algorithm as a particle, then adjust it Intelligently by particle swarm optimization (PSO) algorithm, and improve the effect of clustering. The results of experiment show that the algorithm has effectively solved the problem, improved the result of clustering and the accuracy of damping.

    Reference
    Related
    Cited by
Get Citation

谢文斌,童楠,王忠秋,贾官洪,陈维奇,符强.基于粒子群的近邻传播算法.计算机系统应用,2014,23(3):103-107,76

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