Ensemble nystrom method

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 1060-1068

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

^a GOOGLE INC   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERROR ANALYSIS;

EXPONENTIALS; KERNEL MATRICES; KERNEL-METHODS; LARGE DATASETS; LOW RANK APPROXIMATIONS; NYSTROM METHOD; SCALING KERNEL; SIMPLE++; VERY LARGE DATUM; WEIGHT METHODS;

APPROXIMATION ALGORITHMS;

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

References (19)

1. A. Asuncion and D. Newman. UCI machine learning repository, 2007.
2. B. E. Boser, I. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In COLT, volume 5, pages 144-152, 1992.
3. C. Cortes, M. Mohri, D. Pechyony, and A. Rastogi. Stability of transductive regression algorithms. In ICML, 2008.
4. C. Cortes and V. N. Vapnik. Support-Vector Networks. Machine Learning, 20(3):273-297, 1995.
5. P. Drineas and M. W. Mahoney. On the Nyström method for approximating a Gram matrix for improved kernel-based learning. JMLR, 6:2153-2175, 2005.
6. C. Fowlkes, S. Belongie, F. Chung, and J. Malik. Spectral grouping using the Nyström method. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2), 2004.
7. G. Golub and C. V. Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 2nd edition, 1983.
8. 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.
9. S. Kumar, M. Mohri, and A. Talwalkar. Sampling techniques for the Nyström method. In AISTATS, pages 304-311, 2009.
10. Y. LeCun and C. Cortes. The MNIST database of handwritten digits, 2009.
11. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212261, 1994.
12. D. G. Lowe. Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 60:91-110, 2004.
13. J. C. Platt. Fast embedding of sparse similarity graphs. In NIPS, 2004.
14. C. Saunders, A. Gammerman, and V. Vovk. Ridge Regression Learning Algorithm in Dual Variables. In Proceedings of the ICML '98, pages 515-521, 1998.
15. B. Schölkopf, A. Smola, and K.-R. Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299-1319, 1998.
16. T. Sim, S. Baker, and M. Bsat. The CMU PIE database. In Conference on Automatic Face and Gesture Recognition, 2002.
17. A. Talwalkar, S. Kumar, and H. Rowley. Large-scale manifold learning. In CVPR, 2008.
18. C. K. I. Williams and M. Seeger. Using the Nyström method to speed up kernel machines. In NIPS, pages 682-688, 2000.
19. K. Zhang, I. Tsang, and J. Kwok. Improved Nyström low-rank approximation and error analysis. In ICML, pages 273-297, 2008.