Joint kernel maps

11Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop a methodology for solving high dimensional dependency estimation problems between pairs of data types, which is viable in the case where the output of interest has very high dimension, e.g., thousands of dimensions. This is achieved by mapping the objects into continuous or discrete spaces, using joint kernels. Known correlations between input and output can be defined by such kernels, some of which can maintain linearity in the outputs to provide simple (closed form) pre-images. We provide examples of such kernels and empirical results. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Weston, J., Schölkopf, B., & Bousquet, O. (2005). Joint kernel maps. In Lecture Notes in Computer Science (Vol. 3512, pp. 176–191). Springer Verlag. https://doi.org/10.1007/11494669_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free