Improved Nyström low-rank approximation and error analysis

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 1232-1239

  Zhang, Kai ^a   Tsang, Ivor W ^a   Kwok, James T ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; ERROR ANALYSIS; K-MEANS CLUSTERING; MACHINE LEARNING; QUALITY CONTROL; SUPERVISED LEARNING; CLUSTERING ALGORITHMS; CURVE FITTING; ERRORS; LEARNING ALGORITHMS; LEARNING SYSTEMS; PROGRAMMING THEORY; ROBOT LEARNING;

APPROXIMATION QUALITY; COMPUTATIONAL BURDEN; EFFICIENT SAMPLING SCHEMES; LOW RANK APPROXIMATIONS; LOW-RANK MATRIX APPROXIMATIONS; PROBABILISTIC SAMPLING; STATE-OF-THE-ART APPROACH; THEORY AND PRACTICE;

APPROXIMATION ALGORITHMS;

APPROXIMATION QUALITIES; COMPUTATIONAL BURDENS; EFFECTIVE TOOLS; EFFICIENT SAMPLINGS; ERROR BOUNDS; GREEDY SCHEMES; K-MEANS CLUSTERING ALGORITHMS; KERNEL METHODS; LEARNING TASKS; LEAST SQUARES; LOW-RANK APPROXIMATIONS; LOW-RANK MATRICES; PERFORMANCE GAINS; PROBABILISTIC SAMPLINGS; SAMPLING SCHEMES; STATE-OF-THE-ART APPROACHES; THEORY AND PRACTICES;

EID: 56449087564     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390311     Document Type: Conference Paper

References (23)

1. Achlioptas, D., & McSherry, F. (2001). Fast computation of low rank matrix approximations. Proceedings of the 23th Annual ACM Symposium on Theory of Computing (pp. 611-618).
2. Bach, F., & Jordan, M. (2002). Kernel independent component analysis. Journal of Machine Learning Research, 3, 1-48.
3. Bach, F., & Jordan, M. (2005). Predictive low-rank decomposition for kernel methods. Proceedings of the 22th International Conference on Machine Learning (pp. 33 -40).
4. Baker, C. (1977). The numerical treatment of integral equations. Oxford: Clarendon Press.
5. Belkin, M., & Niyogi, P. (2002). Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems 14.
6. Drineas, P., Drinea, E., & Huggins, P. (2003). An experimental evaluation of a Monte-Carlo algorithm for singular value decomposition. Proceedings of 8th Panhellenic Conference on Informatics (pp. 279-296).
7. Drineas, P., & Mahoney, M. W. (2005). On the Nyström method for approximating a Gram matrix for improved kernel-based learning. Journal of Machine Learning Research, 6, 2153-2175.
8. Elkan, E. (2003). Using the triangular inequality to accelerate k-means. Proceedings of the 21th International Conference on Machine Learning (pp. 147-153).
9. Fine, S., & Scheinberg, K. (2001). Efficient SVM training using low-rank kernel representations. Journal of Machine Learning Research, 2, 243-264.
10. Fowlkes, C., Belongie, S., Chung, F., & Malik, J. (2004). Spectral grouping using the Nyström method. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26, 214-225.
11. Frieze, A., Kannan, R., & Vempala, S. (1998). Fast Monte-Carlo algorithms for finding low-rank approximations. Proceedings of the 39th Annual Symposium on Foundations of Computer Science (pp. 370-378).
12. Gersho, A., & Gray, R. (1992). Vector quantization and signal compression. Boston: Kluwer Academic Press.
13. Golub, G., & Van Loan, C. (1996). Matrix computations. Johns Hopkins University Press. 3rd edition.
14. Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2001). An efficient fr-means clustering algorithm: analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 881-892.
15. Lawrence, N. Seeger, M., & Herbrich, R. (2003). Fast sparse Gaussian process methods: The informative vector machine. Advances in Neural Information Processing Systems. (pp. 625-632). MIT Press.
16. Ouimet, M., & Bengio, Y. (2005). Greedy spectral embedding. Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (pp. 253-260).
17. Piatt, J. C. (2005). Fastmap, MetricMap, and Landmark MDS are all Nyström algorithms. Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (pp. 261-268).
18. Schölkopf, B., Smola, A., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10, 1299-1319.
19. Smola, A., & Schölkopf, B. (2000). Sparse greedy matrix approximation for machine learning. Proceedings of the 17th International Conference on Machine Learning (pp. 911-918).
20. Suykens, J., & Vandewalle, J. (1999). Least squares support vector machine classifiers. Neural Processing Letters, 9, 293-300.
21. Williams, C., & Seeger, M. (2000). The effect of the input density distribution on kernel-based classifiers. Proceedings of the 17th International Conference on Machine Learning (pp. 1159-1166).
22. Williams, C., & Seeger, M. (2001). Using the Nyström method to speed up kernel machines. Advances in Neural Information Processing Systems 13 (pp. 682-688).
23. Zhang, K., & Kwok, J. (2006). Block-quantized kernel matrix for fast spectral embedding. Proceedings of the 23rd international conference on Machine learning (pp. 1097-1104).