A combined Weisfeiler–Lehman graph kernel for structured data
From MaRDI portal
Publication:4689131
DOI10.1142/S021969131850039XzbMath1398.05145OpenAlexW2802404313WikidataQ114614479 ScholiaQ114614479MaRDI QIDQ4689131
Jin Xiao, Bin Luo, Lixiang Xu, Xiu Chen, Lixin Cui, Yuan Yan Tang
Publication date: 15 October 2018
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021969131850039x
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62) Kernel functions in one complex variable and applications (30C40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph kernels from the Jensen-Shannon divergence
- Fast depth-based subgraph kernels for unattributed graphs
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- A multiple attributes convolution kernel with reproducing property
- A Mixed Weisfeiler-Lehman Graph Kernel
- An efficient multiple kernel learning in reproducing kernel Hilbert spaces (RKHS)
- Learning Theory and Kernel Machines
- Learning Theory and Kernel Machines