Mapping Distance Graph Kernels using Bipartite Matching.

Tetsuya Kataoka Eimi Shiotsuki Akihiro Inokuchi

Published in: ICPRAM (2017)

Keyphrases

graph kernels
bipartite matching
structured data
gaussian processes
maximum weight
kernel methods
data representation
minimum cost flow
distance measure
distance function
kernel machines
link prediction
kernel function
euclidean distance
special case
random walk