Learning low-rank kernel matrices

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 505-512

  Kulis, Brian ^a   Sustik, Mátyás ^a   Dhillon, Inderjit ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BREGMAN MATRIX; DIVERGENCES; FULL-RANK KERNELS; LOW RANK KERNELS;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA PRIVACY; LEARNING SYSTEMS;

MATRIX ALGEBRA;

EID: 34250754976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143908     Document Type: Conference Paper

References (15)

1. Bach, F., & Jordan, M. (2005). Predictive low-rank decomposition for kernel methods. Proc. ICML-2005.
2. Barnes, J., & Hut, P. (1986). A hierarchical O(n log n) force calculation algorithm. Nature, 324, 446-449.
3. Bregman, L. (1967). The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comp. Mathematics and Mathematical Physics, 7, 200-217.
4. Censor, Y., & Zenios, S. (1997). Parallel optimization. Oxford University Press.
5. Demmel, J. D. (1997). Applied numerical linear algebra. Society for Industrial and Applied Mathematics.
6. Fine, S., & Scheinberg, K. (2001). Efficient SVM training using low-rank kernel representations. Journal of Machine Learning Research, 2, 243-264.
7. Golub, G. H., & Van Loan, C. F. (1996). Matrix computations. Johns Hopkins University Press.
8. Greengard, L., & Rokhlin, V. (1987). A fast algorithm for particle simulations. J. Comput. Phys., 73, 325-348.
9. Higham, N. (2002). Computing the nearest correlation matrix - a problem from finance. IMA J. Numerical Analysis, 22, 329-343.
10. Kulis, B., Basu, S., Dhillon, I., & Mooney, R. (2005). Semisupervised graph clustering: A kernel approach. Proc. ICML-2005.
11. Kwok, J., & Tsang, I. (2003). Learning with idealized kernels. Proc. ICML-2003.
12. Lanckriet, G., Cristianini, N., Bartlett, P., Ghaoui, L. E., & Jordan, M. (2004). Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5, 27-72.
13. Shawe-Taylor, J., & Cristianini, N. (2004). Kernel methods for pattern analysis. Cambridge University Press.
14. Tsuda, K., Rätsch, G., & Warmuth, M. (2005). Matrix exponentiated gradient updates for online learning and Bregman projection. Journal of Machine Learning Research, 6, 995-1018.
15. Weinberger, K., Sha, F., & Saul, L. (2004). Learning a kernel matrix for nonlinear dimensionality reduction. Proc. ICML-2004.