Approximate spectral clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5476 LNAI, Issue , 2009, Pages 134-146

  Wang, Liang ^a   Leckie, Christopher ^a   Ramamohanarao, Kotagiri ^a   Bezdek, James ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Matrix approximation; Sampling; Scalability; Spectral clustering

Indexed keywords

COMPUTATIONAL CHALLENGES; COMPUTATIONAL COSTS; DATA SETS; EMPIRICAL COMPARISON; LARGE DATASETS; MATRIX APPROXIMATION; REAL WORLD DATA; SAMPLING STRATEGIES; SPECTRAL CLUSTERING;

MINING;

SCALABILITY;

EID: 67650686504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01307-2_15     Document Type: Conference Paper

References (21)

1. Xu, R., Wunsch II, D.: Survey of clustering algorithms. IEEE Trans. Neural Networks 16(3), 645-678 (2005)
2. Luxburg, U.: A tutorial on spectral clustering. Technical report, Max Planck Institute for Biological Cybernetics, Germany (2006)
3. Fowlkes, C., Belongie, S., Chung, F., Malik, J.: Spectral grouping using the Nyström method. IEEE Trans. Pattern Analysis and Machine Intelligence 26(2), 214-225 (2004)
4. Ning, H., Xu, W., Chi, Y., Gong, Y., Huang, T.: Incremental spectral clustering with application to monitoring of evolving blog communities. In: SIAM Conference on Data Mining (2007)
5. Miao, G., Song, Y., Zhang, D., Bai, H.: Parallel spectral clustering algorithm for large-scale community data mining. In: International Conference on WWW (2008)
6. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence 22(8), 888-905 (2000) (Pubitemid 30941154)
7. Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A min-max cut algorithm for graph partitioning and data clustering. In: International Conference on Data Mining, pp. 107-114 (2001)
8. Chung, F.: Spectral Graph Theory. American Mathematical Society (1997)
9. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems (2001)
10. Williams, C., Seeger, M.: Using the Nyström method to speed up kernel machines. In: Advances in Neural Information Processing Systems, pp. 682-688 (2000)
11. Zhang, K., Tsang, I.W., Kwok, J.T.: Improved Nyström low-rank approximation and error analysis. In: International Conference on Machine Learning (2008)
12. Deshpande, A., Rademacher, L., Vempala, S.,Wang, G.: Matrix approximation and projective clustering via volume sampling. In: Symposium on Discrete Algorithms (2006)
13. Drineas, P., Kannan, R., Mahoney, M.: Fast Monte Carlo algorithms for matrices II: computing a low-rank approximation to a matrix. SIAM Journal on Computing 36(1), 158-183 (2006) (Pubitemid 46374022)
14. Talwalkar, A., Kumar, S., Rowley, H.: Large-scale manifold learning. In: International Conference on Computer Vision and Pattern Recognition (2008)
15. Pavan, M., Pelillo, M.: Efficient out-of-sample extension of dominant-set clusters. In: Advances in Neural Information Processing Systems (2004)
16. Bezdek, J., Hathaway, R., Huband, J., Leckie, C., Kotagiri, R.: Approximate clustering in very large relational data. International Journal of Intelligent Systems 21(8), 817-841 (2006) (Pubitemid 44196348)
17. He, X., Niyogi, P.: Locality preserving projections. In: Advances in Neural Information Processing Systems (2003)
18. Wang, L., Bezdek, J.C., Leckie, C., Kotagiri, R.: Selective sampling for approximate clustering of very large data sets. International Journal of Intelligence Systems 23(3), 313-331 (2008) (Pubitemid 351322241)
19. Cai, D., He, X., Han, J.: Document clustering using locality preserving indexing. IEEE Trans. Knowledge and Data Engineering 17(2), 1637-1642 (2005)
20. Lovasz, L., Plummer, M.: Matching Theory. Akademiai Kiado. North Holland, Budapest (1986)
21. Georghiades, A., Belhumeur, P., Kriegman, D.: From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Analysis and Machine Intelligence 23(6), 643-660 (2001) (Pubitemid 32585276)