JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2011, Vol. 41 ›› Issue (4): 20-23.

• Articles • Previous Articles     Next Articles

A fast affinity propagation clustering algorithm

LIU Xiao-yong1,2,3, FU Hui2   

  1. 1. National Science Library, Chinese Academy of Sciences, Beijing 100190, China;
    2. Department of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China;
    3. Graduate University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:2011-02-14 Online:2011-08-16 Published:2011-02-14

Abstract:

An important parameter of affinity propagation algorithm (AP), damping factor, affects the speed of AP. Because the value of damping factor is fixed in traditional AP algorithm, the convergence performance of AP algorithm is sensitive to the parameter’s choosing. A novel and fast AP algorithm, F-AP, was proposed. The new algorithm used the constriction factor to regulate damping factor dynamically. Three datasets and iris dataset were used to compare AP and F-AP. The numerical results showed that F-AP could accelerate the convergence process effectively.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!