… efficiency and robustness of inverse probability weighting (IPW) relative to kernel matching
(… , to assess which type of estimate is generally more efficient and robust. In the interest of …

… The correct choice of these basis functions is fundamental to the efficiency and effectiveness
of the matching – the chosen bases should represent the underlying signal using a …

… devised an efficient algorithm for evaluation of string kernels based on inexact matching of
… Using the two above mentioned results our algorithm efficiently approximate kernel matrices …

… results efficiently. However, despite their runtime being independent of the filter kernel size,
… the curse of large label spaces very efficiently, while still maintaining or even improving the …

… matching the kernel in a certain way. It is unclear how to generalize it to handle more general
kernels. … (independent of 𝜇) for arbitrary kernels. Unconditional lower bounds have already …

… Ours and the addKPCA approximation match/ outperform the exact kernels even with as
little as 3D. The ¼ 1=2 variants (Section 2.1) perform better still, probably because they tend to …

… SVM has proved to be one of the most efficient kernel method. The success of SVM is mainly
due to its high generalization ability. Unlike many learning algorithms, SVM leads to good …

… kernels for graph matching and clustering. Firstly, we analyze different kinds of graph kernels
in … divergences, and we show how this method can be efficiently integrated into a central …

… To solve this problem, in what follows we develop a very effective approximation of the
mismatch kernel that allows efficient inexact matching between embedded sequences. …

… kernel technique, we can compute all-length match-weighted … to compute efficiently the
gapped kernels without restriction of … kernels can be computed efficiently using the suffix kernel. …