Graphs
 
Edit

Link Prediction

971 papers with code • 80 benchmarks • 67 datasets

Link Prediction is a task in graph and network analysis where the goal is to predict missing or future connections between nodes in a network. Given a partially observed network, the goal of link prediction is to infer which links are most likely to be added or missing based on the observed connections and the structure of the network.

( Image credit: Inductive Representation Learning on Large Graphs )

Libraries

Use these libraries to find Link Prediction models and implementations

Datasets

Subtasks

Most implemented papers

Most implemented Social Latest No code

Attention Is All You Need

tensorflow/tensor2tensor • • NeurIPS 2017

The dominant sequence transduction models are based on complex recurrent or convolutional neural networks in an encoder-decoder configuration.

594
Paper
Code

Graph Attention Networks

PetarV-/GAT • • ICLR 2018

We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations.

93
Paper
Code

Modeling Relational Data with Graph Convolutional Networks

tkipf/relational-gcn • • 17 Mar 2017

We demonstrate the effectiveness of R-GCNs as a stand-alone model for entity classification.

27
Paper
Code

Variational Graph Auto-Encoders

tkipf/gae • • 21 Nov 2016

We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE).

22
Paper
Code

Neural Graph Collaborative Filtering

xiangwang1223/neural_graph_collaborative_filtering • • 20 May 2019

Further analysis verifies the importance of embedding propagation for learning better user and item representations, justifying the rationality and effectiveness of NGCF.

21
Paper
Code

node2vec: Scalable Feature Learning for Networks

aditya-grover/node2vec • 3 Jul 2016

Taken together, our work represents a new way for efficiently learning state-of-the-art task-independent representations in complex networks.

20
Paper
Code

Inductive Representation Learning on Large Graphs

williamleif/GraphSAGE • • NeurIPS 2017

Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions.

20
Paper
Code

Graph Convolutional Matrix Completion

riannevdberg/gc-mc • • 7 Jun 2017

We consider matrix completion for recommender systems from the point of view of link prediction on graphs.

17
Paper
Code

Benchmarking Graph Neural Networks

graphdeeplearning/benchmarking-gnns • • 2 Mar 2020

In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs.

15
Paper
Code

Hierarchical Graph Representation Learning with Differentiable Pooling

dmlc/dgl • • NeurIPS 2018

Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node classification and link prediction.

14
Paper
Code
Contact us on: hello@paperswithcode.com . Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Data policy Cookies policy