The kernelHMM : Learning Kernel Combinations in Structured Output Domains

Volker Roth, Bernd Fischer

Abstract

We present a model for learning convex kernel combinations in classification problems with structured output domains. The main ingredient is a hidden Markov model which forms a layered directed graph. Each individual layer represents a multilabel version of nonlinear kernel discriminant analysis for estimating the emission probabilities. These kernel learning machines are equipped with a mechanism for finding convex combinations of kernel matrices. The resulting kernelHMM can handle multiple partial paths through the label hierarchy in a consistent way. Efficient approximation algorithms allow us to train the model to large-scale learning problems. Applied to the problem of document categorization, the method exhibits excellent predictive performance.
BibTeX
@inproceedings{roth2007kernelhmm,
  author = {Volker Roth and Bernd Fischer},
  title = {{The kernelHMM : Learning Kernel Combinations in Structured Output Domains}},
  booktitle = {DAGM-Symposium},
  year = {2007},
  doi = {10.1007/978-3-540-74936-3\_44},
}

Loading related content...

Figure