Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2309.16604
Cited By
Exploiting Edge Features in Graphs with Fused Network Gromov-Wasserstein Distance
28 September 2023
Junjie Yang
Matthieu Labeau
Steeven Villa
OT
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Exploiting Edge Features in Graphs with Fused Network Gromov-Wasserstein Distance"
12 / 12 papers shown
Title
The Z-Gromov-Wasserstein Distance
Martin Bauer
Facundo Mémoli
Tom Needham
Mao Nishino
OT
66
2
0
15 Aug 2024
Online Graph Dictionary Learning
Cédric Vincent-Cuaz
Titouan Vayer
Rémi Flamary
Marco Corneli
Nicolas Courty
58
46
0
12 Feb 2021
Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification
Yunsheng Shi
Zhengjie Huang
Shikun Feng
Hui Zhong
Wenjin Wang
Yu Sun
AI4CE
93
789
0
08 Sep 2020
Principal Neighbourhood Aggregation for Graph Nets
Gabriele Corso
Luca Cavalleri
Dominique Beaini
Pietro Lio
Petar Velickovic
GNN
114
668
0
12 Apr 2020
A General Framework for Consistent Structured Prediction with Implicit Loss Embeddings
C. Ciliberto
Lorenzo Rosasco
Alessandro Rudi
156
51
0
13 Feb 2020
Gromov-Wasserstein Factorization Models for Graph Clustering
Hongteng Xu
68
50
0
19 Nov 2019
Representation Learning for Dynamic Graphs: A Survey
Seyed Mehran Kazemi
Rishab Goel
Kshitij Jain
I. Kobyzev
Akshay Sethi
Peter Forsyth
Pascal Poupart
AI4TS
AI4CE
GNN
103
456
0
27 May 2019
Optimal Transport for structured data with application on graphs
Titouan Vayer
Laetitia Chapel
Rémi Flamary
R. Tavenard
Nicolas Courty
OT
68
274
0
23 May 2018
Graph Attention Networks
Petar Velickovic
Guillem Cucurull
Arantxa Casanova
Adriana Romero
Pietro Lio
Yoshua Bengio
GNN
479
20,164
0
30 Oct 2017
Neural Message Passing for Quantum Chemistry
Justin Gilmer
S. Schoenholz
Patrick F. Riley
Oriol Vinyals
George E. Dahl
593
7,455
0
04 Apr 2017
Fast Computation of Wasserstein Barycenters
Marco Cuturi
Arnaud Doucet
OT
100
741
0
16 Oct 2013
Subgraph Matching Kernels for Attributed Graphs
Nils Kriege
Petra Mutzel
61
279
0
27 Jun 2012
1