Variational Graph Auto-Encoders
Thomas N. Kipf, Max Welling
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/tkipf/gaeOfficialtf★ 0
- github.com/pygod-team/pygodpytorch★ 1,482
- github.com/DaehanKim/vgae_pytorchpytorch★ 420
- github.com/deezer/linear_graph_autoencoderstf★ 136
- github.com/lfhase/cigapytorch★ 121
- github.com/xiyou3368/DGVAEtf★ 26
- github.com/qkrdmsghk/GOODHSEpytorch★ 14
- github.com/jjzgeeks/vgae-based_model_poisoning_attack_flpytorch★ 4
- github.com/Monti03/LinkPredictionOverClusterstf★ 0
- github.com/fleverest/gravity_graph_autoencoderstf★ 0
Abstract
We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model using a graph convolutional network (GCN) encoder and a simple inner product decoder. Our model achieves competitive results on a link prediction task in citation networks. In contrast to most existing models for unsupervised learning on graph-structured data and link prediction, our model can naturally incorporate node features, which significantly improves predictive performance on a number of benchmark datasets.
Tasks
Benchmark Results
| Dataset | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| Citeseer | GAE | ACC | 40.8 | — | Unverified |
| Cora | GAE | ACC | 59.6 | — | Unverified |
| Pubmed | VGAE | ACC | 65.48 | — | Unverified |