Search Results for author:
Found 5 papers, 2 papers with code
Anchor Space Optimal Transport: Accelerating Batch Processing of Multiple OT Problems
Therefore, we propose a translated OT problem designated as the anchor space optimal transport (ASOT) problem, which is specially designed for batch processing of multiple OT problem solutions.
Wasserstein Graph Distance Based on $L_1$-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees
In this paper, we propose a novel graph metric called the Wasserstein WL Subtree (WWLS) distance to address this problem.
Wasserstein Weisfeiler-Lehman Subtree Distance for Graph-Structured Data
Therefore, instead of using such categorical labels, we define a node distance between WL subtrees with tree edit distance and propose an efficient calculation algorithm.
LCS Graph Kernel Based on Wasserstein Distance in Longest Common Subsequence Metric Space
Therefore, we propose a novel metric space by exploiting the proposed LCS-based similarity, and compute a new Wasserstein-based graph distance in this metric space, which emphasizes more the comparison between similar paths.
Graph embedding using multi-layer adjacent point merging model
For graph classification tasks, many traditional kernel methods focus on measuring the similarity between graphs.
