Graph Machine Learning, Graph Kernels, Explicit Feature Maps, Scalable Machine Learning.
distribution in the collected paths. Weisfeiler-Lehman kernel For each node in the graph, collect the labels from its neighbors and sort them. Then create a new label from the resulting string. Iterate t times and create t+1 labels for each node. The vectors consist of the ids of these labels. The