Making large-scale Nyström approximation possible

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 631-638

  Li, Mu ^a   Kwok, James T ^b   Lu, Bao Liang ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; EIGENVALUE DECOMPOSITION; INPUT MATRICES; KERNEL MATRICES; LOW RANK APPROXIMATIONS; LOW-RANK MATRICES; M METHOD; SUBMATRIX; TIME COMPLEXITY; VERY LARGE DATUM;

EIGENVALUES AND EIGENFUNCTIONS; LEARNING SYSTEMS; SINGULAR VALUE DECOMPOSITION;

APPROXIMATION ALGORITHMS;

EID: 77956549641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Belkin, M. and Niyogi, P. Laplacian eigenmaps and spectral techniques for embedding and clustering. In NIPS 14, 2002.
2. Drineas, P. and Mahoney, M.W. On the Nyström method for approximating a Gram matrix for improved kernel-based learning. Journal of Machine Learning Research, 6:2175, 2005.
3. Drineas, P., Kannan, R., and Mahoney, M.W. 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)
4. Fowlkes, C., Belongie, S., Chung, F., and Malik, J. Spectral grouping using the Nyström method. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2):214-225, February 2004.
5. Halko, N., Martinsson, P.-G., and Tropp, J.A. Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions. Technical report, 2009.
6. Kumar, S., Mohri, M., and Talwalkar, A. Sampling techniques for the Nyström method. In AISTATS, 2009.
7. Kumar, S., Mohri, M., and Talwalkar, A. Ensemble Nyström method. In NIPS 22, 2010.
8. Lehoucq, R.B., Sorensen, D.C., and Yang, C. ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, 1998.
9. Lütkepohl, H. Handbook of Matrices. John Wiley and Sons, 1996.
10. Stewart, G.W. Matrix perturbation theory. SIAM Review, 1990.
11. Tenenbaum, J.B., de Silva, V., and Langford, J.C. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
12. von Luxburg, U. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, December 2007.
13. Williams, C.K.I. and Seeger, M. Using the Nyström method to speed up kernel machines. In NIPS 13, 2001.
14. Zhang, K., Tsang, I.W., and Kwok, J.T. Improved Nyström low rank approximation and error analysis. In ICML, 2008.