en-es
en-fr
en-sl
en
en-zh
en-de
0.25
0.5
0.75
1.25
1.5
1.75
2
Fast Subtree Kernels on Graphs
Published on 2010-01-196881 Views
In this article, we propose fast subtree kernels on graphs. On graphs with n nodes and m edges and maximum degree d, these kernels comparing subtrees of height h can be computed in O(mh), whereas th