Fast subtree kernels on graphs

NIPS, pp. 1660-1668, 2009.

Cited by: 248|Views190
EI
Weibo:
We propose fast subtree kernels on graphs

Abstract:

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 the classic subtree kernel by Ramon & Gartner scales as O(n24dh). Key to this efficiency is the observation that the Weisfeiler-Lehman test of i...More

Code:

Data:

0
Your rating :
0

 

Best Paper
Best Paper of NeurIPS, 2009
Tags
Comments