Learning nonparametric kernel matrices from pairwise constraints

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 361-368

  Hoi, Steven C H ^a   Jin, Rong ^b   Lyu, Michael R ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b Michigan State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LAPLACE EQUATION; LINEAR SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING;

KERNEL MATRICES; NONPARAMETRIC KERNELS; SEMI-DEFINITE PROGRAMS (SDP);

LEARNING ALGORITHMS;

EID: 34547975734     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273542     Document Type: Conference Paper

References (20)

1. Bar-Hillel, A., Hertz, T., Shental, N., & Weinshall, D. (2005). Learning a mahalanobis metric from equivalence constraints. JMLR, 6, 937-965.
2. Belkin, M., Matveeva, I., & Niyogi, P. (2004). Regularization and semi-supervised learning on large graphs. Annual Conference on Learning Theory (COLT2004).
3. Boyd, S., & Vandenberghe, L. (2003). Convex optimization. Cambridge University Press.
4. Chapelle, O., Weston, J., &: Scholkopf, B. (2003). Cluster kernels for semi-supervised learning. NIPS2003.
5. Cristianini, N., Shawe-Taylor, J., Elisseeff, A., & Kandola, J. (2001). On kernel-target alignment. NIPS2001.
6. Hoi, S. C. H., Lyu, M. R., &: Chang, E. Y. (2006). Learning the unified kernel machines for classification. KDD2006 (pp. 187-196). Philadelphia, PA, US.
7. Kondor, R., & Lafferty, J. (2002). Diffusion kernels on graphs and other discrete structures. ICML2002.
8. Kulis, B., Sustik, M., & Dhillon, I. S. (2006). Learning low-rank kernel matrices. ICML2006 (pp. 505-512).
9. Lanckriet, G., Cristianini, N., Bartlett, P., Ghaoui, L. E., & Jordan, M. (2004). Learning the kernel matrix with semi-definite programming. JMLR, 5, 27-72.
10. Lee, D. D., &: Seung, H. S. (2000). Algorithms for non-negative matrix factorization. NIPS'13 (pp. 556-562).
11. Löfberg, J. (2004). YALMIP: A toolbox for modeling and optimization in MATLAB. The CACSD Conference.
12. Platt, J. C. (1999). Fast training of support vector machines using sequential minimal optimization. Advances in kernel methods: support vector learning, 185-208.
13. Scholkopf, B., & Smola, A. (2002). Learning with kernels. MIT Press.
14. Shewchuk, J. (1994). An introduction to the conjugate gradient method without the agonizing poinTechnical Report CMU-CS-94-125). Carnegie Mellon University.
15. Vapnik, V. N. (1998). Statistical learning theory. John Wiley &: Sons.
16. Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained k-means clustering with background knowledge. ICML2000 (pp. 577-584).
17. Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2002). Distance metric learning with application to clustering with side-information. NIPS2002.
18. Zhang, T., & Ando, R. K. (2005). Analysis of spectral kernel design based semi-supervised learning. NIPS2005.
19. Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semi-supervised learning using gaussian fields and harmonic functions. ICML2003.
20. Zhu, X., Kandola, J., Ghahramani, Z., & Lafferty, J. (2005). Nonparametric transforms of graph kernels for semi-supervised learning. NIPS2005.