LCS graph kernel based on Wasserstein distance in longest common subsequence metric space-Reference-Cited by-同舟云学术

LCS graph kernel based on Wasserstein distance in longest common subsequence metric space

Author:

Huang Jianming,Fang Zhongxi,Kasai Hiroyuki

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Signal Processing,Software,Control and Systems Engineering

Reference56 articles.

1. Graph kernels;Vishwanathan;J. Mach. Learn. Res.,2010

2. A survey on graph kernels;Kriege;Appl. Netw. Sci.,2020

3. Graph embedding using multi-layer adjacent point merging model;Huang,2021

4. Deeper insights into graph convolutional networks for semi-supervised learning;Li,2018

5. Measuring and relieving the over-smoothing problem for graph neural networks from the topological view;Chen,2020

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Safe Screening for ℓ₂-penalized Unbalanced Optimal Transport Problem;2024 International Joint Conference on Neural Networks (IJCNN);2024-06-30

4. Key Vertex Pairs Extraction for Graph Classification Based on Probability Distribution Learning;2024 International Conference on Artificial Intelligence in Information and Communication (ICAIIC);2024-02-19

5. Image2InChI: Automated Molecular Optical Image Recognition;Journal of Chemical Information and Modeling;2024-02-15