Block-quantized kernel matrix for fast spectral embedding

ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning

Volumn 2006, Issue , 2006, Pages 1097-1104

  Zhang, Kai ^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; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EIGENVALUES AND EIGENFUNCTIONS; IMAGE SEGMENTATION; PRINCIPAL COMPONENT ANALYSIS; PROBLEM SOLVING;

APPROXIMATION QUALITY; CUBIC COMPLEXITY; EIGENDECOMPOSITION; KERNEL MATRIX;

LEARNING SYSTEMS;

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

References (17)

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. Baker, C. (1977). The numerical treatment of integral equations. Oxford: Clarendon Press.
4. Bhatia, R. (1997). Matrix analysis. New York: Springer-Verlag.
5. Cour, T., Bénézit, F., & Shi, J. (2005). Spectral segmentation with multiscale graph decomposition. International Conference on Computer Vision and Pattern Recognition (pp. 1124-1131).
6. 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.
7. Feder, T., & Greene, D. (1988). Optimal algorithms for approximate clustering. Proceedings of the 20th ACM Symposium on Theory of Computing (pp. 434-444).
8. Fine, S., & Scheinberg, K. (2001). Efficient SVM training using low-rank kernel representations. Journal of Machine Learning Research, 2, 243-264.
9. 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.
10. 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.
11. Moore, A. (1998). Very fast EM-based mixture model clustering using multiresolution kd-trees. Advances in Neural Information Processing Systems (pp. 543-549). San Mateo, CA: Morgan Kaufmann.
12. Ouimet, M., &: Bengio, Y. (2005). Greedy spectral embedding. Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (pp. 253-260).
13. Schölkopf, B., Smola, A., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10, 1299-1319.
14. Shi, J., &: Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888-905.
15. Smola, A. J., &: Bartlett, P. L. (2000). Sparse greedy Gaussian process regression. Advances in Neural Information Processing System (pp. 619-625).
16. 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).
17. Williams, C., &: Seeger, M. (2001). Using the Nyström method to speed up kernel machines. Advances in Neural Information Processing Systems, (pp. 682-688).