Sampling techniques for the Nyström method

Journal of Machine Learning Research

Volumn 5, Issue , 2009, Pages 304-311

  Kumar, Sanjiv ^a   Mohri, Mehryar ^b   Talwalkar, Ameet ^b  

^a GOOGLE INC   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOW-RANK MATRICES; M METHOD; NONUNIFORM SAMPLING; PERFORMANCE BOUNDS; REAL-WORLD DATASETS; SAMPLING TECHNIQUE; UNIFORM SAMPLING;

SOFTWARE ENGINEERING;

ARTIFICIAL INTELLIGENCE;

EID: 84862286216     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (20)

1. A. Asuncion and D.J. Newman. UC Irvine machine learning repository, http://www.ics.uci.edu/∼mlearn/MLRepository.html 2007.
2. Bernhard E. Boser, Isabelle Guyon, and Vladimir N. Vapnik. A training algorithm for optimal margin classifiers. In COLT, 1992.
3. Corinna Cortes and Vladimir N. Vapnik. Support-Vector Networks. Machine Learning, 20(3):273-297, 1995.
4. Corinna Cortes, Mehryar Mohri, Dmitry Pechyony, and Ashish Rastogi. Stability of transductive regression algorithms. In ICML, 2008.
5. Vin de Silva and Joshua B. Tenenbaum. Global versus local methods in nonlinear dimensionality reduction. In NIPS, 2002.
6. Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang. Matrix approximation and projective clustering via volume sampling. In Symposium on Discrete Algorithms, 2006.
7. Petros Drineas and Michael W. Mahoney. On the Nystr̈om Method for Approximating a Gram Matrix for Improved Kernel-Based Learning. Journal of Machine Learning Research, 6:2153-2175, 2005.
8. Petros Drineas, Eleni Drinea, and Patrick S. Huggins. An experimental evaluation of a Monte-Carlo algorithm for SVD. In Panhellenic Conference on Informatics, 2001.
9. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication. SIAM J. Comput., 36(1):132-157, 2006.
10. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM J. Comput., 36(1), 2006.
11. Petros Drineas. Personal communication, 2008.
12. Charless Fowlkes, Serge Belongie, Fan Chung, and Jitendra Malik. Spectral grouping using the Nyström method. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2), 2004.
13. A. Gustafson, E. Snitkin, S. Parker, C. DeLisi, and S. Kasif. Towards the identification of essential genes using targeted genome sequencing and comparative analysis. BMC:Genomics, 7:265, 2006.
14. Yann LeCun and Corinna Cortes. The MNIST database of handwritten digits, http://yann.lecun.com/exdb/mnist/2009.
15. John C. Platt. Fast embedding of sparse similarity graphs. In NIPS, 2003.
16. Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299-1319, 1998.
17. Terence Sim, Simon Baker, and Maan Bsat. The CMU pose, illumination, and expression database. In Conference on Automatic Face and Gesture Recognition, 2002.
18. Ameet Talwalkar, Sanjiv Kumar, and Henry Rowley. Large-scale manifold learning. In CVPR, 2008.
19. Christopher K. I. Williams and Matthias Seeger. Using the Nystr̈om method to speed up kernel machines. In NIPS, 2000.
20. Kai Zhang, Ivor W. Tsang, and James T. Kwok. Improved Nystr̈om low-rank approximation and error analysis. In ICML, 2008.