Some kernels for structured data
PL Bartlett, Bernhard Schölkopf · MPG.PuRe (Max Planck Society) · 2001
Rational kernels■ maps a seq.x sto seq.z with a weight ■ defines a "weighed relation" T(x, z) → R ■ is implemented by a finite state automaton • Kernelx, y are similar if they are transduced often to the same z -K(x,y) = Σ z T(x, z) T(y, z) • AdvantageGiven an automaton for T, can construct an automaton for K 2 x z Rational kernels: Implementation • Automaton for K(x, y) ■ invert T ■ compose T and T -1 3