Indefinite kernels arise in practice, e.g. from problem-specific kernel construction. Therefore, it is necessary to understand the behavior and suitability of classifiers in the c...
Recent approaches of graph comparison consider graphs as sets of paths [6, 5]. Kernels on graphs are then computed from kernels on paths. A common strategy for graph retrieval is ...
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences...
Huma Lodhi, John Shawe-Taylor, Nello Cristianini, ...
In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We in...