en
0.25
0.5
0.75
1.25
1.5
1.75
2
Graph Characterization via Backtrackless paths
Published on Oct 17, 20113130 Views
Random walks on graphs have been extensively used for graph characterization. Positive kernels between labeled graphs have been proposed recently. In this paper we use backtrackless paths for gauging
Related categories
Chapter list
Graph Characterization via Backtrackless Paths00:00
Motivation00:04
Graph Kernels03:14
Path Kernels05:45
Cycle Kernels06:57
Graph Characterizations08:09
Heat kernel09:59
Connections12:06
Ihara Zeta Function - 113:07
Ihara Zeta Function - 214:17
Ihara Zeta Function - 315:32
Ihara Zeta Function - 417:17
Ihara Zeta Function - 518:30
Observations19:49
Backtrackless Random Walk20:54
Labelled and Unlabelled graphs22:18
Backtrackless Random Walk Kernel23:06
Efficient computation24:08
Kernels and characterizations25:40
Experiments – Synthetic Graphs26:25
Experiments27:14
Real world data27:39
Results28:09
Time analysis28:39
Conclusion29:20
Questions?29:44