Wasserstein Embedding for Graph Learning

06/16/2020
by   Soheil Kolouri, et al.
0

We present Wasserstein Embedding for Graph Learning (WEGL), a novel and fast framework for embedding entire graphs in a vector space, in which various machine learning models are applicable for graph-level prediction tasks. We leverage new insights on defining similarity between graphs as a function of the similarity between their node embedding distributions. Specifically, we use the Wasserstein distance to measure the dissimilarity between node embeddings of different graphs. Different from prior work, we avoid pairwise calculation of distances between graphs and reduce the computational complexity from quadratic to linear in the number of graphs. WEGL calculates Monge maps from a reference distribution to each node embedding and, based on these maps, creates a fixed-sized vector representation of the graph. We evaluate our new graph embedding approach on various benchmark graph-property prediction tasks, showing state-of-the-art classification performance, while having superior computational efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2022

On a linear fused Gromov-Wasserstein distance for graph structured data

We present a framework for embedding graph structured data into a vector...
research
02/18/2018

Node Centralities and Classification Performance for Characterizing Node Embedding Algorithms

Embedding graph nodes into a vector space can allow the use of machine l...
research
06/04/2019

Wasserstein Weisfeiler-Lehman Graph Kernels

Graph kernels are an instance of the class of R-Convolution kernels, whi...
research
05/31/2023

Bures-Wasserstein Means of Graphs

Finding the mean of sampled data is a fundamental task in machine learni...
research
04/01/2019

Unsupervised Inductive Whole-Graph Embedding by Preserving Graph Proximity

We introduce a novel approach to graph-level representation learning, wh...
research
12/02/2020

Partial Gromov-Wasserstein Learning for Partial Graph Matching

Graph matching finds the correspondence of nodes across two graphs and i...
research
10/02/2022

Metric Distribution to Vector: Constructing Data Representation via Broad-Scale Discrepancies

Graph embedding provides a feasible methodology to conduct pattern class...

Please sign up or login with your details

Forgot password? Click here to reset