482 search results - page 29 / 97 » A Linear-Time Graph Kernel |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
SODA
2012
ACM
13 years 5 days ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
IJFCS
2007
14 years 9 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
PKDD
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...