www-ai.cs.tu-dortmund.de/LEHRE/FACHPROJEKT/SS14/Papers/StringKernels/LodhiSSCW02.pdf
indices i = (i1, . . . , i|u|), with 1 ≤ i1 < · · · < i|u| ≤ |s|, such that uj = sij , for j = 1, . . . , |u|, or u = s[i] for short. The length l(i) of the subsequence in s is i|u| − i1 + 1. We denote by [...] 0(s, t) = 1, for all s, t,
K ′ i(s, t) = 0, if min (|s|, |t|) < i,
Ki(s, t) = 0, if min (|s|, |t|) < i, K ′
i(sx, t) = λK ′ i(s, t) +
∑ j:tj=x
K ′ i−1(s, t[1 : j − 1])λ|t|−j+2,
i = 1, . . . , n− 1, Kn(sx [...] different lengths. More Formally
K = ( K(di, dj)
) 1≤i,j≤n
= ( K1(di, dj
) +K2(di, dj)
) 1≤i,j≤n
= K1 +K2
where K1 is string subsequence kernel matrix for length k1 and K2 is for length k2. The value of the weight …