Learning Metrics via Discriminant Kernels and Multidimensional Scaling: Toward Expected Euclidean Representation

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 872-879

  Zhang, Zhihua ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INFORMATION ANALYSIS; LEARNING SYSTEMS; MAPPING; METRIC SYSTEM; PATTERN RECOGNITION; VECTORS;

EUCLIDEAN REPRESENTATION; KERNELS; LEARNING METRICS; MULTIDIMENSIONAL SCALING;

COMPUTER SCIENCE;

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

References (19)

1. Bach, F. R., & Jordan, M. I. (2003). Learning graphical models with Mercer kernels. Advances in Neural Information Processing Systems 15. Cambridge, MA: MIT Press.
2. Borg, I., & Groenen, P. (1997). Modern multidimensional scaling. New York: Springer-Verlag.
3. Bousquet, O., & Herrmann, D. J. L. (2003). On the complexity of learning the kernel matrix. Advances in Neural Information Processing Systems 15. Cambridge, MA: MIT Press.
4. Cox, T. F., & Ferry, G. (1993). Discriminant analysis using non-metric multidimensional scaling. Pattern Recognition, 26, 145-153.
5. Cristianini, N., Kandola, J., Elisseeff, A., & Shawe-Taylor, J. (2002). On kernel target alignment, Advances in Neural Information Processing Systems 14. Cambridge, MA: MIT Press.
6. Gower, J. C., & Legendre, P. (1986). Metric and Euclidean properties of dissimilarities coefficients. Journal of Classification, 3, 5-48.
7. Haussler, D. (1999). Convolution kernels on discrete structures (Technical Report UCSC-CRL-99-10). Department of Computer Science, University of California at Santa Cruz.
8. Kandola, J., Shawe-Taylor, J., & Cristianini, N. (2002a). On the extensions of kernel alignment (Technical Report 2002-120). NeuroCOLT.
9. Kandola, J., Shawe-Taylor, J., & Cristianini, N. (2002b). Optimizing kernel alignment over combinations of kernels (Technical Report 2002-121). NeuroCOLT.
10. Koontz, W. L. G., & Fukunaga, K. (1972). A nonlinear feature extraction algorithm using distance information. IEEE Transactions on Computers, 21, 56-63.
11. Lanckriet, G. R. G., Cristianini, N., Ghaoui, L. E., Bartlett, P., & Jordan, M. I. (2002). Learning the kernel matrix with semi-definite programming. The 19th International Conference on Machine Learning.
12. Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2323-2326.
13. Schölkopf, B., & Smola, A. J. (2002). Learning with kernels. The MIT Press.
14. Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319-2323.
15. Vapnik, V. (1995). The nature of statistical learning theory. New York: Springer-Verlag.
16. Wahba, G. (1990). Spline models for observational data. Philadelphia: SIAM.
17. Webb, A. R. (1995). Multidimensional scaling by iterative majorization using radial basis functions. Pattern Recognition, 28, 753-759.
18. Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2003). Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems 15. Cambridge, MA: MIT Press.
19. Zhang, Z., Kwok, J. T., & Yeung, D. Y. (2003). Parametric distance metric with label information (Technical Report HKUST-CS03-02). Department of Computer Science, Hong Kong University of Science and Technology.