482 search results - page 17 / 97 » A Linear-Time Graph Kernel |
NIPS
2008
14 years 11 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
ICML
2002
IEEE
15 years 10 months ago
2002
IEEE
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
ENDM
2008
14 years 9 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
86
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...