LCS Graph Kernel Based on Wasserstein Distance in Longest Common Subsequence Metric Space

by   Jianming Huang, et al.

For graph classification tasks, many methods use a common strategy to aggregate information of vertex neighbors. Although this strategy provides an efficient means of extracting graph topological features, it brings excessive amounts of information that might greatly reduce its accuracy when dealing with large-scale neighborhoods. Learning graphs using paths or walks will not suffer from this difficulty, but many have low utilization of each path or walk, which might engender information loss and high computational costs. To solve this, we propose a graph kernel using a longest common subsequence (LCS kernel) to compute more comprehensive similarity between paths and walks, which resolves substructure isomorphism difficulties. We also combine it with optimal transport theory to extract more in-depth features of graphs. Furthermore, we propose an LCS metric space and apply an adjacent point merge operation to reduce its computational costs. Finally, we demonstrate that our proposed method outperforms many state-of-the-art graph kernel methods.


page 1

page 2

page 3

page 4


Transport based Graph Kernels

Graph kernel is a powerful tool measuring the similarity between graphs....

Graph embedding using multi-layer adjacent point merging model

For graph classification tasks, many traditional kernel methods focus on...

On the Discrete Fréchet Distance in a Graph

The Fréchet distance is a well-studied similarity measure between curves...

Kernel Wasserstein Distance

The Wasserstein distance is a powerful metric based on the theory of opt...

Walk Extraction Strategies for Node Embeddings with RDF2Vec in Knowledge Graphs

As KGs are symbolic constructs, specialized techniques have to be applie...

A Multi-scale Graph Signature for Persistence Diagrams based on Return Probabilities of Random Walks

Persistence diagrams (PDs), often characterized as sets of death and bir...

Statistical and Computational Trade-Offs in Kernel K-Means

We investigate the efficiency of k-means in terms of both statistical an...

Please sign up or login with your details

Forgot password? Click here to reset