Fast subtree kernels on graphs - VideoLectures

Introduction
Subtree <strong>kernels</strong>
The 1-dimensional Weisfeiler-Lehman algorithm: Iteration 2
1. Multiset-label
determination and
sorting
O(m) via bucket sort
2. Label compression
O(m) via radix sort
3. Relabeling O(n)
Are the label sets of G
and G ′ identical? No.
Output YES
Overall complexity -
O(hm) for h iterations
2,24
2,24
2, 34
2, 34
2,33
2,33
3,224
3,224
2,24 5 3,224
2,33
6 3,234
2,34
7 4,2233
3,234
3,234
4,2233
4,2233
8
9
10
N. Shervashidze, K. Borgwardt <strong>Fast</strong> <strong>subtree</strong> <strong>kernels</strong> on graphs NIPS 9