Dynamic Link Prediction
20 papers with code • 10 benchmarks • 8 datasets
Benchmarks
These leaderboards are used to track progress in Dynamic Link Prediction
| Trend | Dataset | Best Model | Paper | Code | Compare |
|---|---|---|---|---|---|
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
Libraries
Use these libraries to find Dynamic Link Prediction models and implementationsDatasets
Reddit
WN18
HeriGraph
Most implemented papers
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
IBM/EvolveGCN
•
•
Existing approaches typically resort to node embeddings and use a recurrent neural network (RNN, broadly speaking) to regulate the embeddings and learn the temporal dynamics.
Canonical Tensor Decomposition for Knowledge Base Completion
facebookresearch/kbc
•
•
ICML 2018
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem.
DyRep: Learning Representations over Dynamic Graphs
Harryi0/dyrep_torch
•
•
ICLR 2019
We present DyRep - a novel modeling framework for dynamic graphs that posits representation learning as a latent mediation process bridging two observed processes namely -- dynamics of the network (realized as topological evolution) and dynamics on the network (realized as activities between nodes).
Variational Graph Recurrent Neural Networks
VGraphRNN/VGRNN
•
•
NeurIPS 2019
Representation learning over graph structured data has been mostly studied in static graph settings while efforts for modeling dynamic graphs are still scant.
DyG2Vec: Efficient Representation Learning for Dynamic Graphs
Temporal graph neural networks have shown promising results in learning inductive representations by automatically extracting temporal patterns.
Towards Better Dynamic Graph Learning: New Architecture and Unified Library
yule-buaa/dyglib
•
•
NeurIPS 2023
We propose DyGFormer, a new Transformer-based architecture for dynamic graph learning.
dyngraph2vec: Capturing Network Dynamics using Dynamic Graph Representation Learning
Capturing such evolution is key to predicting the properties of unseen networks.
Learning Temporal Attention in Dynamic Graphs with Bilinear Interactions
We consider a common case in which edges can be short term interactions (e. g., messaging) or long term structural connections (e. g., friendship).
Benchmarking Graph Neural Networks on Dynamic Link Prediction
We compare link prediction heuristics, GNNs, discrete DGNNs, and continuous DGNNs on dynamic link prediction.
Learning Self-Modulating Attention in Continuous Time Space with Applications to Sequential Recommendation
User interests are usually dynamic in the real world, which poses both theoretical and practical challenges for learning accurate preferences from rich behavior data.
