Graph Diffusion Wasserstein Distances - Archive ouverte HAL Access content directly
Conference Papers Year :

Graph Diffusion Wasserstein Distances

(1) , (2) , (1) , (3) , (1)
1
2
3

Abstract

Optimal Transport (OT) for structured data has received much attention in the machine learning community, especially for addressing graph classification or graph transfer learning tasks. In this paper, we present the Diffusion Wasserstein (DW) distance, as a generalization of the standard Wasserstein distance to undirected and connected graphs where nodes are described by feature vectors. DW is based on the Laplacian exponential kernel and benefits from the heat diffusion to catch both structural and feature information from the graphs. We further derive lower/upper bounds on DW and show that it can be directly plugged into the Fused Gromov Wasserstein (FGW) distance that has been recently proposed, leading-for free-to a DifFused Gromov Wasserstein distance (DFGW) that allows a significant performance boost when solving graph domain adaptation tasks.
Fichier principal
Vignette du fichier
ECML-2020.pdf (448.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02795056 , version 1 (05-06-2020)

Identifiers

  • HAL Id : hal-02795056 , version 1

Cite

Amélie Barbe, Marc Sebban, Paulo Gonçalves, Pierre Borgnat, Rémi Gribonval. Graph Diffusion Wasserstein Distances. ECML PKDD 2020 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Sep 2020, Ghent, Belgium. pp.1-16. ⟨hal-02795056⟩
426 View
1369 Download

Share

Gmail Facebook Twitter LinkedIn More