no code implementations • 22 Oct 2021 • Till Hendrik Schulz, Pascal Welke, Stefan Wrobel
The majority of popular graph kernels is based on the concept of Haussler's $\mathcal{R}$-convolution kernel and defines graph similarities in terms of mutual substructures.
no code implementations • 20 Jan 2021 • Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel
The Weisfeiler-Lehman graph kernels are among the most prevalent graph kernels due to their remarkable time complexity and predictive performance.
