dyngraph2vec: Capturing Network Dynamics using Dynamic Graph Representation Learning
About
Learning graph representations is a fundamental task aimed at capturing various properties of graphs in vector space. The most recent methods learn such representations for static networks. However, real world networks evolve over time and have varying dynamics. Capturing such evolution is key to predicting the properties of unseen networks. To understand how the network dynamics affect the prediction performance, we propose an embedding approach which learns the structure of evolution in dynamic graphs and can predict unseen links with higher precision. Our model, dyngraph2vec, learns the temporal transitions in the network using a deep architecture composed of dense and recurrent layers. We motivate the need of capturing dynamics for prediction on a toy data set created using stochastic block models. We then demonstrate the efficacy of dyngraph2vec over existing state-of-the-art methods on two real world data sets. We observe that learning dynamics can improve the quality of embedding and yield better performance in link prediction.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Dynamic Link Detection | ENRON | AP93.16 | 44 | |
| Dynamic new link prediction | Social Evo. | AP0.7179 | 37 | |
| Link Prediction | Hep-th real-world (test) | Avg MAP73.9 | 11 | |
| Link Prediction | AS real-world (test) | Avg MAP38.01 | 11 | |
| Dynamic new link prediction | COLAB | AUC0.7606 | 10 | |
| Dynamic new link prediction | AUC76.35 | 10 | ||
| Link Prediction | SBM synthetic (test) | Average MAP0.9581 | 8 | |
| Link Prediction | BC-OTC | mAP0.022 | 7 | |
| Link Prediction | BC-Alpha | mAP0.11 | 7 | |
| Dynamic Link Detection | COLAB (10 runs on random splits) | AUC77.38 | 7 |