An Aligned Subtree Kernel for Weighted Graphs

In this paper, we develop a new entropic matching kernel for weighted graphs by aligning depth-based representations. We demonstrate that this kernel can be seen as an \textbf{aligned subtree kernel}