SOTAVerified

edGNN: a Simple and Powerful GNN for Directed Labeled Graphs

2019-04-18Code Available0· sign in to hype

Guillaume Jaume, An-phi Nguyen, María Rodríguez Martínez, Jean-Philippe Thiran, Maria Gabrani

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

The ability of a graph neural network (GNN) to leverage both the graph topology and graph labels is fundamental to building discriminative node and graph embeddings. Building on previous work, we theoretically show that edGNN, our model for directed labeled graphs, is as powerful as the Weisfeiler-Lehman algorithm for graph isomorphism. Our experiments support our theoretical findings, confirming that graph neural networks can be used effectively for inference problems on directed graphs with both node and edge labels. Code available at https://github.com/guillaumejaume/edGNN.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
MUTAGedGNN (max)Accuracy88.8Unverified
MUTAGedGNN (avg)Accuracy86.9Unverified

Reproductions