Fast density-weighted low-rank approximation spectral clustering

Data Mining and Knowledge Discovery

Volumn 23, Issue 2, 2011, Pages 345-378

  Shang, Fanhua ^a   Jiao, L C ^a   Shi, Jiarong ^a   Gong, Maoguo ^a   Shang, R H ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Affinity propagation; Clustering; Data mining; Manifold structure; Nystr m approximation; Spectral clustering

Indexed keywords

AFFINITY PROPAGATION; AP ALGORITHM; CLUSTERING; CLUSTERINGS; COMPUTATIONAL COSTS; DATA MANIFOLDS; DATA SETS; DENSITY-WEIGHTED; EFFICIENT SAMPLING; GLOBAL CONSISTENCY; GLOBAL STRUCTURE; GRAPH PARTITIONING; HIGH QUALITY; LARGE DATASETS; LOW RANK APPROXIMATIONS; MANIFOLD STRUCTURE; MEMORY USAGE; OPTIMAL CLUSTERING; SCOPE OF APPLICATION; SMALL DATA SET; SPARSE GRAPHS; SPECTRAL CLUSTERING; TWO STAGE;

APPROXIMATION ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 78751645088     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-010-0207-5     Document Type: Article

References (51)

1. Baker C (1977) The numerical treatment of integral equations. Clarendon, Oxford
2. M Balasubramanian EL Schwartz JB Tenenbaum V de Silva JC Langford 2002 The Isomap algorithm and topological stability Science 295 5552 7 10.1126/science.295.5552.7a
3. M-A Belabbas PJ Wolfe 2009 Spectral methods in machine learning and new strategies for very large datasets Proc Natl Acad Sci USA 106 369 374 10.1073/pnas.0810600105
4. Berkhin P (2002) Survey of clustering data mining techniques. Technical Report. Accrue Software. http://www.ee.ucr.edu/~barth/EE242/clustering-survey. pdf
5. Ding CHQ, He X, Zha H, Gu M, Simon HD (2001) A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of IEEE international conference on data mining (ICDM), pp 107-114
6. WE Donath AJ Hofmann 1973 Lower bounds for the partitioning of graphs IBM J Res Dev 17 420 425 10.1147/rd.175.0420 0259.05112
7. P Drineas MW Mahoney 2005 On the Nyström method for approximating a Gram matrix for improved kernel-based learning J Mach Learn Res 6 2153 2175 2249884 (Pubitemid 41832630)
8. Duda RO, Hart PE, Stork DG (2001) Pattern classification. Wiley, New York
9. Fei-Fei L, Fergus R, Perona P (2004) Learning generative visual models from few training examples: an incremental Bayesian approach tested on 101 object categories. In: IEEE conference on computer vision and pattern recognition. Workshop on generative model based vision, pp 178-178
10. C Fowlkes S Belongie F Chung J Malik 2004 Spectral grouping using the Nyström method IEEE Trans Pattern Anal Mach Intell 26 2 214 225 10.1109/TPAMI.2004.1262185
11. ND Freitas Y Wang M Mahdaviani D Lang 2006 Fast Krylov methods for N-body learning Adv Neural Inf Process Syst 18 251 258
12. BJ Frey D Dueck 2007 Clustering by passing messages between data points Science 305 5814 972 976 10.1126/science.1136800 2292174 (Pubitemid 46281181)
13. AS Georghiades PN Belhumeur DJ Kriegman 2001 From few to many: illumination cone models for face recognition under variable lighting and pose IEEE Trans Pattern Anal Mach Intell 23 6 643 660 10.1109/34.927464 (Pubitemid 32585276)
14. Givoni I, Frey BJ (2009) Semi-supervised affinity propagation with instance-level constraints. In: Proceedings of the 14th international workshop on Artificial Intelligence and Statistics (AISTATS), vol 5. JMLR W&CP, Clearwater Beach, FL, pp 161-168
15. L Hagen A Kahng 1992 New spectral methods for ratio cut partitioning and clustering IEEE Trans Computer Aided Des Integr Circuits Syst 11 9 1074 1085 10.1109/43.159993 (Pubitemid 23555831)
16. Han J, Kamber M (2001) Data mining: concepts and techniques. Morgan Kaufmann Publishers, San Francisco
17. A Jain M Murty P Flynn 1999 Data clustering: a review ACM Comput Surv 31 3 264 323 10.1145/331499.331504
18. Jia Y, Wang J, Zhang C, Hua X (2008) Finding image exemplars using fast sparse affinity propagation. In: Proceedings of ACM multimedia, pp 639-642
19. W Johnson J Lindenstrauss 1984 Extensions of Lipschitz mappings into a Hilbert space Contemp Math 26 189 206 737400 0539.46017
20. F Kschischang BJ Frey H-A Loeliger 2001 Factor graphs and the sum-product algorithm IEEE Trans Inform Theory 47 2 498 519 10.1109/18.910572 1820474 0998.68234 (Pubitemid 32318087)
21. Kumar S, Mohri M, Talwalkar A (2009) Sampling techniques for the Nyström method. In: Proceedings of the 14th international workshop on Artificial Intelligence and Statistics (AISTATS), vol 5. JMLR W&CP, Clearwater Beach, FL, pp 304-311
22. Lazebnik S, Schmid C, Ponce J (2006) Beyond bags of features: spatial pyramid matching for recognizing natural scene categories. In: Proceedings of IEEE conference on computer vision and pattern recognition (CVPR), pp 2169-2178 (Pubitemid 44931582)
23. JA Lee M Verleysen 2005 Nonlinear dimensionality reduction of data manifolds with essential loops Neurocomputing 67 1 29 53 (Pubitemid 40945714)
24. M Leone Sumedha M Weigt 2007 Clustering by soft-constraint affinity propagation: applications to gene-expression data Bioinformatics 23 20 2708 2715 10.1093/bioinformatics/btm414 (Pubitemid 350048335)
25. T Liu AW Moore AG Gray K Yang 2005 An investigation of practical approximate nearest neighbor algorithms Adv Neural Inf Process Syst 17 825 832
26. Liu W, He J, Chang S (2010) Large graph construction for scalable semi-supervises learning. In: Proceedings of the 27th international conference on machine learning (ICML), pp 679-686
27. D Madigan N Raghavan W Dumouchel M Nason C Posse G Ridgeway 2002 Likelihood-based data squashing: a modeling approach to instance construction Data Min Knowl Discov 6 173 190 10.1023/A:1014095614948 1917936 0996.68564 (Pubitemid 37113871)
28. Mahadevan S (2008) Fast spectral learning using Lanczos eigenspace projections. In: Proceedings of the 23rd national conference on artificial intelligence (AAAI), pp 1472-1475
29. P Mitra CA Murthy SK Pal 2002 Density-based multiscale data condensation IEEE Trans Pattern Anal Mach Intell 24 6 734 747 10.1109/TPAMI.2002.1008381 (Pubitemid 34669588)
30. A Ng M Jordan Y Weiss 2002 On spectral clustering: analysis and an algorithm Adv Neural Inf Process Syst 14 849 856
31. Ouimet M, Bengio Y (2005) Greedy spectral embedding. In: Proceedings of the 10th international workshop on artificial intelligence and statistics (AISTATS), pp 253-260
32. Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover, New York
33. J Shi J Malik 2000 Normalized cuts and image segmentation IEEE Trans Pattern Anal Mach Intell 22 8 888 905 10.1109/34.868688
34. Song Y, Chen W-Y, Bai H, Lin C-J, Chang EY (2008) Parallel spectral clustering. In: Proceedings of learning and principles and practice of knowledge discovery in databases (ECML/PKDD), pp 374-389
35. A Strehl J Ghosh 2002 Cluster ensembles-a knowledge reuse framework for combining multiple partitions J Mach Learn Res 3 583 617 10.1162/ 153244303321897735 1991087
36. Talwalkar A, Kumar S, Rowley H (2008) Large-scale manifold learning. In: Proceedings of IEEE conference on computer vision and pattern recognition (CVPR), pp 1-8
37. JB Tenenbaum V de Silva JC Langford 2000 A global geometric framework for nonlinear dimensionality reduction Science 290 5500 2319 2323 10.1126/science.290.5500.2319 (Pubitemid 32041577)
38. Vidal R, Ma Y, Piazzi J (2004) A new GPCA algorithm for clustering subspaces by fitting, differentiating and dividing polynomials. In: Proceedings of IEEE conference on computer vision and pattern recognition (CVPR), pp 510-517
39. U von Luxburg 2007 A tutorial on spectral clustering Stat Comput 17 4 395 416 10.1007/s11222-007-9033-z 2409803
40. F Wang C Zhang 2008 Label propagation through linear neighborhoods IEEE Trans Knowl Data Eng 20 1 55 67 10.1109/TKDE.2007.190672 (Pubitemid 350197265)
41. C Williams M Seeger 2001 Using the Nyström method to speed up kernel machines Adv Neural Inf Process Syst 13 682 688
42. T Wittkop J Baumbach F Lobo S Rahmann 2007 Large scale clustering of protein sequences with FORCE-A layout based heuristic for weighted cluster editing BMC Bioinformatics 8 1 396 10.1186/1471-2105-8-396 (Pubitemid 350278739)
43. M Wu B Schölkopf 2007 A local learning approach for clustering Adv Neural Inf Process Syst 19 1529 1536
44. Xiao J, Wang J, Tan P, Quan L (2007) Joint affinity propagation for multiple view segmentation. In: Proceedings of IEEE 11th international conference on computer vision (ICCV), pp 1-7
45. R Xu D Wunsch 2005 Survey of clustering algorithms IEEE Trans Neural Netw 16 3 645 678 10.1109/TNN.2005.845141 (Pubitemid 40718010)
46. Yan D, Huang L, Jordan M (2009) Fast approximate spectral clustering. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 907-916
47. Yann L, Corinna C (2009) The MNIST database of handwritten digits. http://yann.lecun.com/exdb/mnist/
48. L Zelnik-Manor P Perona 2005 Self-tuning spectral clustering Adv Neural Inf Process Syst 17 1601 1608
49. Zhang K, Kwok J (2008) Improved Nyström low rank approximation and error analysis. In: Proceedings of the 25th international conference on machine learning (ICML), pp 273-297
50. K Zhang J Kwok 2009 Density-weighted Nyström method for computing large kernel Eigen-Systems Neural Comput 21 121 146 10.1162/neco.2009.11-07-651 2464843 1178.68480
51. D Zhou O Bousquet TN Lal J Weston B Schölkopf 2004 Learning with local and global consistency Adv Neural Inf Process Syst 16 321 328