Graph Machine Learning, Graph Kernels, Explicit Feature Maps, Scalable Machine Learning.
distribution of the labels in all the walks. (Note that for unlabeled graphs it is usual to use the node degree as a label.) Shortest path kernel For each node, record the shortest path to each other node in the graph. Then, similarly to the k-walk kernel, create vectors that describe the label