Fast subtree kernels on graphs - VideoLectures

The Weisfeiler-Lehman kernel on graphs
Differences between test and kernel
WL kernel vs isomorphism test
The test
◮ checks sets of node labels of
two graphs for identity after
each iteration
◮ stops when the sets become
different or when number of
iterations reaches n
◮ is computed in O(hm)
N. Shervashidze, K. Borgwardt <strong>Fast</strong> <strong>subtree</strong> <strong>kernels</strong> on graphs NIPS 10