Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Tsuda, K.
Right arrow Articles by Müller, K.-R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Tsuda, K.
Right arrow Articles by Müller, K.-R.
(Neural Computation. 2002;14:2397-2414.)
© 2002 The MIT Press


Letter

A New Discriminative Kernel from Probabilistic Models

Koji Tsuda

koji.tsuda{at}aist.go.jp, AIST Computational Biology Research Center, Koto-ku, Tokyo, 135-0064, Japan, and Fraunhofer FIRST, 12489 Berlin, Germany

Motoaki Kawanabe

nabe{at}first.fraunhofer.de, Fraunhofer FIRST, 12489 Berlin, Germany

Gunnar Rätsch

Gunnar.Raetsch{at}anu.edu.au, Australian National University, Research School for Information Sciences and Engineering, Canberra, ACT 0200, Australia, and Fraunhofer FIRST, 12489 Berlin, Germany

Sören Sonnenburg

sonne{at}first.fraunhofer.de, Fraunhofer FIRST, 12489 Berlin, Germany

Klaus-Robert Müller

klaus{at}first.fraunhofer.de, Fraunhofer FIRST, 12489 Berlin, Germany, and University of Potsdam, 14469 Potsdam, Germany

Recently, Jaakkola and Haussler (1999) proposed a method for constructing kernel functions from probabilistic models. Their so-called Fisher kernel has been combined with discriminative classifiers such as support vector machines and applied successfully in, for example, DNA and protein analysis. Whereas the Fisher kernel is calculated from the marginal log-likelihood, we propose the TOP kernel derived from tangent vectors of posterior log-odds. Furthermore, we develop a theoretical framework on feature extractors from probabilistic models and use it for analyzing the TOP kernel. In experiments, our new discriminative TOP kernel compares favorably to the Fisher kernel.




This article has been cited by other articles:


Home page
IEICE Trans Inf & SystHome page
M. SUGIYAMA and H. OGAWA
Constructing Kernel Functions for Binary Regression
IEICE Trans D: Information, July 1, 2006; E89-D(7): 2243 - 2249.
[Abstract] [PDF]


Home page
J. Lipid Res.Home page
H. H. Lin, L. Y. Han, H. L. Zhang, C. J. Zheng, B. Xie, and Y. Z. Chen
Prediction of the functional class of lipid binding proteins from sequence-derived properties irrespective of sequence similarity
J. Lipid Res., April 1, 2006; 47(4): 824 - 831.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
K. Tsuda, S. Akaho, M. Kawanabe, and K.-R. Muller
Asymptotic Properties of the Fisher Kernel
Neural Comput., January 1, 2004; 16(1): 115 - 137.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2002 by The MIT Press.