A local approach of adaptive affinity propagation clustering for large scale data

Authors:
Changyin Sun;Chenghong Wang;Su Song;Yifan Wang
Affiliations:
School of Automation, Southeast University and College of Electrical Engineering, Hohai University, Nanjing, China;Department of information Science, Natural Science Foundation of China, Beijing, China;Department of information Science, Natural Science Foundation of China, Beijing, China;College of Electrical Engineering, Hohai University, Nanjing, China
Venue:
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Year:
2009

Citing 4
Cited 2

Silhouettes: a graphical aid to the interpretation and validation of cluster analysis

Journal of Computational and Applied Mathematics
Cure: an efficient clustering algorithm for large databases

Information Systems
Cluster validation techniques for genome expression data

Signal Processing - Special issue: Genomic signal processing
Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories

CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 12 - Volume 12

Web Page Clustering via Partition Adaptive Affinity Propagation

ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
Performance analysis of improved affinity propagation algorithm for image semantic annotation

ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Affinity propagation exhibits fast execution speed and finds clusters with low error rate when clustering sparsely related data but its values of parameters are fixed. This paper proposes a modified method named partition adaptive affinity propagation, which can automatically eliminate oscillations and adjust the values of parameters when rerunning affinity propagation procedure to yield optimal clustering results, with high execution speed and precision. Experiments are carried on VCI datasets and Caltech101 dataset, and ORL faces dataset. The results verify that this adaptive method is effective and feasible.