Fast Subtree Kernels on Graphs
Published on Jan 19, 20106865 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