Affinity Propagation Clustering Based on Teaching Learning-Based Optimization
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    Aiming at the limitation of the clustering effect caused by the preference and damping factors in Affinity Propagation (AP), a Teaching and Learning Based Optimization (TLBO) algorithm is proposed. First, the search space of parameter p is determined, and then the TLBO algorithm is used to find the optimal parameter value in the search space. At the same time, the damping factor is automatically adjusted to prevent numerical oscillations during the clustering process, so as to improve the clustering quality of AP algorithm. The experimental results show that the algorithm can effectively solve the problem caused by preference and damping factors, improve the contour coefficient of clustering, and reduce the clustering error rate.

    Reference
    Related
    Cited by
Get Citation

马翩翩,张新刚,梁晶晶.基于教与学优化改进的近邻传播聚类算法.计算机系统应用,2020,29(5):220-225

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 23,2019
  • Revised:November 20,2019
  • Adopted:
  • Online: May 07,2020
  • Published: May 15,2020
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