A generalized Weisfeiler-Lehman graph kernel

DOI10.1007/S10994-022-06131-WMaRDI QIDQ2102326zbMATH OpenOpenAlexFDO

Authors Till Hendrik Schulz, T. Horváth, Pascal Welke, Stefan Wrobel

Publication date 28 November 2022

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2101.08104

zbMATH Keywords

graph kerneltree edit distanceWasserstein distanceWeisfeiler-Lehman

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A survey on tree edit distance and related problems
• Least squares quantization in PCM
• Lov\'asz Meets Weisfeiler and Leman
• On graph kernels: hardness results and efficient alternatives.
• Probabilistic learning on graphs via contextual architectures
• Stochastic Blockmodels for Directed Graphs
• Weisfeiler-Lehman graph kernels

Cited in

(1)

• A Mixed Weisfeiler-Lehman Graph Kernel

Describes a project that uses

Uses Software

• SNAP
• GraKeL
• TUDataset
• GitHub

This page was built for publication: A generalized Weisfeiler-Lehman graph kernel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102326)