AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

GOT: An Optimal Transport framework for Graph comparison

Hermina Petric Maretic, Mireille El Gheche, Giovanni Chierchia, Pascal Frossard

NeurIPS 2019 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 54 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use Wasserstein distance between smooth graph signal distributions (GOT) instead of Euclidean distance on Laplacians (ablation)stochastic graph alignment · distorted SBM graph alignment (40 nodes, 4 communities)community detection NMIImproved
GOT instead of Gromov-Wasserstein for alignmentgraph alignment · distorted SBM graph alignmentGW's own error measureHurt
GOT instead of GW, FGM, IPFP, RRWM, NetLSD1-NN graph classification · random graph models (SBM2, SBM3, RG, BA, WS)accuracyImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy