Adaptive Affinity Propagation Clustering

Details Adaptive Affinity Propagation Clustering Adaptive Affinity Propagation Clustering

2008-05-08

arxiv.org/abs/0805.1096v1

K. Wang, J. Zhang, D. Li, X. Zhang and T. Guo. Adaptive Affinity Propagation Clustering. Acta Automatica Sinica, 33(12):1242-1

Computer Science

Artificial Intelligence

an English version of original paper

Scientific paper

Affinity propagation clustering (AP) has two limitations: it is hard to know what value of parameter 'preference' can yield an optimal clustering solution, and oscillations cannot be eliminated automatically if occur. The adaptive AP method is proposed to overcome these limitations, including adaptive scanning of preferences to search space of the number of clusters for finding the optimal clustering solution, adaptive adjustment of damping factors to eliminate oscillations, and adaptive escaping from oscillations when the damping adjustment technique fails. Experimental results on simulated and real data sets show that the adaptive AP is effective and can outperform AP in quality of clustering results.

Affiliated with

Also associated with

No associations

Rating

Adaptive Affinity Propagation Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptive Affinity Propagation Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Affinity Propagation Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-52472