Local and global approaches of affinity propagation clustering for large scale data

Journal of Zhejiang University: Science A

Volumn 9, Issue 10, 2008, Pages 1373-1381

  Xia, Ding Yin ^a   Wu, Fei ^a   Zhang, Xu Qing ^a   Zhuang, Yue Ting ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Affinity propagation; Clustering; Landmark affinity propagation; Large scale data; Partition affinity propagation

Indexed keywords

FLOW OF SOLIDS;

AFFINITY PROPAGATION; CLUSTERING; LANDMARK AFFINITY PROPAGATION; LARGE SCALE DATA; PARTITION AFFINITY PROPAGATION;

CLUSTERING ALGORITHMS;

EID: 54249109459     PISSN: 1673565X     EISSN: 18621775     Source Type: Journal    
DOI: 10.1631/jzus.A0720058     Document Type: Article

References (17)

1. Bell, R.M., Koren, Y., Volinsky, C., 2007. Modeling Relationships at Multiple Scales to Improve Accuracy of Large Recommender Systems. Proc. 13th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, San Jose, California, USA, p.95-104. [doi:10.1145/1281192.1281206]
2. A. Ben-Hur D. Horn H.T. Siegelmann V. Vapnik 2001 Support vector clustering J. Machine Learning Res. 2 2 125 137
3. de Silva, V., Tenenbaum, J.B., 2003. Global versus Local Methods in Nonlinear Dimensionality Reduction. Neural Information Processing Systems, p.705-712.
4. de Silva, V., Tenenbaum, J.B., 2004. Sparse Multidimensional Scaling Using Landmark Points. Technical Report. Stanford University.
5. W.E. Donath A.J. Hoffman 1973 Lower bounds for partitioning of graphs IBM J. Res. Dev. 17 5 420 425
6. A.J. Enright S. van Dongen C.A. Ouzounis 2002 An efficient algorithm for large-scale detection of protein families Nucleic Acids Res. 30 7 1575 1584
7. M. Fiedler 1973 Algebraic connectivity of graphs Czech. Math. J. 23 298 305
8. Frey, B.J., Dueck, D., 2006. Mixture Modeling by Affinity Propagation. Neural Information Processing Systems, p.379-386.
9. B.J. Frey D. Dueck 2007 Clustering by passing messages between data points Science 315 5814 972 976
10. S. Guha R. Rastogi K. Shim 2001 CURE: an efficient clustering algorithm for large databases Inf. Syst. 26 1 35 58
11. Kanade, T., Cohn, J.F., Tian, Y.L., 2000. Comprehensive Database for Facial Expression Analysis. Proc. 4th IEEE Int. Conf. on Automatic Face and Gesture Recognition, p.46-53. [doi:10.1109/AFGR.2000.840611]
12. F.R. Kschischang B.J. Frey H.A. Loeliger 2001 Factor graphs and the sum-product algorithm IEEE Trans. on Inf. Theory 47 2 498 519
13. MacQueen, J., 1967. Some Methods for Classification and Analysis of Multivariate Observations. Proc. 5th Berkeley Symp. on Mathematical Statistics and Probability. University of California Press, Berkeley, CA, 1:281-297.
14. A. Pothen H.D. Simon K.P. Liou 1990 Partitioning sparse matrices with eigenvectors of graph SIAM J. Matrix Anal. Appl. 11 3 430 452
15. Silva, J.G., Marques, J.S., Lemos, J.M., 2005. Selecting Landmark Points for Sparse Manifold Learning. Advances in Neural Information Processing Systems. MIT Press.
16. Wittman, T., 2005. MANIfold Learning Matlab Demo. Http://www.math.umn. edu/~wittman/research.html
17. Zhuang, Y.T., Zhang, X.F., Wu, J.Q., Lu, X.Q., 2004. Retrieval of Chinese Calligraphic Character Image. Proc. Pacific Rim Conf. on Multimedia, p.17-24.