Volume 5 Number 11 (Nov. 2010)
Home > Archive > 2010 > Volume 5 Number 11 (Nov. 2010) >
JCP 2010 Vol.5(11): 1731-1738 ISSN: 1796-203X
doi: 10.4304/jcp.5.11.1731-1738

Automatically Affinity Propagation Clustering using Particle Swarm

Xian-hui Wang1, Zheng Qin1, 2, and Xuan-ping Zhang2
1 School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an, Shaanxi, China
2 School of Software, Tsinghua University, Beijing, China


Abstract—Affinity propagation (AP) is a clustering algorithm which has much better performance than traditional clustering approach such as K-means algorithm. AP can usually find a moderate clustering number, but “moderate” usually may not be the “optimal”. If we have found the optimal clustering number of AP, to estimate the input “preferences” (p) and the effective corresponding “preferences” (p) interval from the data sets is hard. In this paper, we propose a new approach called Automatically Affinity Propagation Clustering (AAP).Our AAP method is absolutely “automatic”. AAP represents the issue of finding the optimal AP clustering and the corresponding “preferences” (p) interval as an optimization problem of searching optimal solution of the input “preferences” (p).AAP searches the “preferences” (p) space using Particle Swarm Optimization (PSO) algorithm, and evaluates the particles’ fitness using clustering validation indexes. In order to prevent particles from flying out of defined region, we used Boundary Checking (BC) rule to check the validity of particles’ positions of PSO. According to lots of AAP’s independent runs results, we can find AP’s optimal clustering number and estimate the corresponding “preferences” (p) interval. One artificial data set and several real-world data sets are presented to illustrate the simplicity and effectiveness of AAP.

Index Terms—Automatically Affinity Propagation Clustering; Particle Swarm Optimization; Clustering Validation Indexes; Boundary Checking (BC) rule; “preferences” (p) interval

[PDF]

Cite: Xian-hui Wang, Zheng Qin, and Xuan-ping Zhang, " Automatically Affinity Propagation Clustering using Particle Swarm," Journal of Computers vol. 5, no. 11, pp. 1731-1738, 2010.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>