Adaptive Affinity Propagation Clustering
Artificial Intelligence
2008-05-09 v1
Abstract
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.
Cite
@article{arxiv.0805.1096,
title = {Adaptive Affinity Propagation Clustering},
author = {Kaijun Wang and Junying Zhang and Dan Li and Xinna Zhang and Tao Guo},
journal= {arXiv preprint arXiv:0805.1096},
year = {2008}
}
Comments
an English version of original paper