Fast subtree kernels on graphs - VideoLectures

More documents

Recommendations

Info

Introduction Overview Overview of graph <strong>kernels</strong> Runtime for labeled graphs 10 9 8 7 6 5 4 3 2 Subtree kernel (Ramon and Gaertner, 2003) <strong>Fast</strong> Random Walk (Vishwanathan et al., 2007) Shortest Path (Borgwardt and Kriegel, 2005) 3-Graphlet (Shervashidze et al., 2009) 1 100 200 300 400 500 600 700 800 900 1000 Graph size 100 graphs, <strong>subtree</strong> height 3, alphabet size 25, max. degree n/2, n 2 /2 edges N. Shervashidze, K. Borgwardt <strong>Fast</strong> <strong>subtree</strong> <strong>kernels</strong> on graphs NIPS 5
Introduction Overview Overview of graph <strong>kernels</strong> Runtime for labeled graphs 10 9 8 7 6 5 4 3 2 Subtree kernel (Ramon and Gaertner, 2003) <strong>Fast</strong> Random Walk (Vishwanathan et al., 2007) Shortest Path (Borgwardt and Kriegel, 2005) 3-Graphlet (Shervashidze et al., 2009) Weisfeiler-Lehman <strong>subtree</strong> kernel (this talk) 1 100 200 300 400 500 600 700 800 900 1000 Graph size 100 graphs, <strong>subtree</strong> height 3, alphabet size 25, max. degree n/2, n 2 /2 edges N. Shervashidze, K. Borgwardt <strong>Fast</strong> <strong>subtree</strong> <strong>kernels</strong> on graphs NIPS 5
Page 1 and 2: Fast subtr
Page 3 and 4: Introduction Introduction ◮ Kerne
Page 5 and 6: Introduction Introduction ◮ Kerne
Page 7 and 8: Introduction Overview Overview of g
Page 13: Introduction Overview Overview of g
Page 17 and 18: Introduction Subtree kernel
Page 33 and 34: The Weisfeiler-Lehman kernel on gra
Page 47 and 48: Experimental evaluation Setup Compa
Page 49 and 50: Conclusion Conclusion and outlook
Page 51 and 52: Conclusion Conclusion and outlook

Fast subtree kernels on graphs - VideoLectures

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?