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

v1v2 (latest)

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

7 December 2020

ArXiv (abs)PDF HTML

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

7 / 7 papers shown

Title
CityGPT: Towards Urban IoT Learning, Analysis and Interaction with Multi-Agent System Qinghua Guan Jinhui Ouyang Di Wu Weiren Yu LLMAG AI4CE 118 2 0 23 May 2024
Longest Common Substring in Longest Common Subsequence's Solution Service: A Novel Hyper-Heuristic Ali Z. Abdi Masih Hajsaeedi M. Hooshmand 23 2 0 03 Dec 2022
Wasserstein Graph Distance Based on $L_1$ -Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees Zhongxi Fang Jianming Huang Xun Su Hiroyuki Kasai 107 8 0 09 Jul 2022
On the Convergence of Semi-Relaxed Sinkhorn with Marginal Constraint and OT Distance Gaps Takumi Fukunaga Hiroyuki Kasai OT 155 2 0 27 May 2022
Block-coordinate Frank-Wolfe algorithm and convergence analysis for semi-relaxed optimal transport problem Takumi Fukunaga Hiroyuki Kasai OT 72 8 0 27 May 2022
Fast block-coordinate Frank-Wolfe algorithm for semi-relaxed optimal transport Takumi Fukunaga Hiroyuki Kasai OT 76 6 0 10 Mar 2021
Graph embedding using multi-layer adjacent point merging model Jianming Huang Hiroyuki Kasai 51 3 0 28 Oct 2020

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.