论文信息 - Kernel Dependency Estimation

Kernel Dependency Estimation

We consider the learning problem of finding a dependency between a general class of objects and another, possibly different, general class of objects. The objects can be for example: vectors, images, strings, trees or graphs. Such a task is made possible by employing similarity measures in both input and output spaces using kernel functions, thus embedding the objects into vector spaces. We experimentally validate our approach on several tasks: mapping strings to strings, pattern recognition, and reconstruction from partial images.

[1] A. Michel,et al. Analysis and synthesis of a class of neural networks: linear systems operating on a closed hypercube , 1989 .

[2] J. Friedman,et al. A Statistical View of Some Chemometrics Regression Tools , 1993 .

[3] Vladimir Vapnik,et al. Statistical learning theory , 1998 .

[4] Alexander Gammerman,et al. Ridge Regression Learning Algorithm in Dual Variables , 1998, ICML.

[5] Klaus Obermayer,et al. Classi cation on Pairwise Proximity , 2007 .

[6] B. Scholkopf,et al. Fisher discriminant analysis with kernels , 1999, Neural Networks for Signal Processing IX: Proceedings of the 1999 IEEE Signal Processing Society Workshop (Cat. No.98TH8468).

[7] David Haussler,et al. Convolution kernels on discrete structures , 1999 .

[8] Gunnar Rätsch,et al. Input space versus feature space in kernel-based methods , 1999, IEEE Trans. Neural Networks.

[9] Nello Cristianini,et al. Classification using String Kernels , 2000 .

[10] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .

[11] Bernhard Schölkopf,et al. Learning with kernels , 2001 .