15 search results - page 1 / 3 » Faster computation of the direct product kernel for graph cl... |
138
Voted
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
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...
156
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
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 ...
190
click to vote
NIPS
2000
15 years 7 months ago
2000
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...
151
click to vote
EMNLP
2009
15 years 4 months ago
2009
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...