Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels

DOI10.1007/s10994-021-05991-yOpenAlexW3165985851MaRDI QIDQ2071309

Canh Hao Nguyen, Dai Hai Nguyen, Hiroshi Mamitsuka

Publication date: 28 January 2022

Published in: Machine Learning (Search for Journal in Brave)

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

zbMATH Keywords

optimal transportgraph kernelWeisfeiler Lehman scheme

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Mirror variational transport: a particle-based algorithm for distributional optimization on constrained domains

Uses Software

• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Metric Learning: A Survey
• Algorithms for the Assignment and Transportation Problems
• Optimal Transport

This page was built for publication: Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels