RWR-GAE: Random Walk Regularization for Graph Auto Encoders

12 Aug 2019  ·  Vaibhav, Po-Yao Huang, Robert Frederking ·

Node embeddings have become an ubiquitous technique for representing graph data in a low dimensional space. Graph autoencoders, as one of the widely adapted deep models, have been proposed to learn graph embeddings in an unsupervised way by minimizing the reconstruction error for the graph data. However, its reconstruction loss ignores the distribution of the latent representation, and thus leading to inferior embeddings. To mitigate this problem, we propose a random walk based method to regularize the representations learnt by the encoder. We show that the proposed novel enhancement beats the existing state-of-the-art models by a large margin (upto 7.5\%) for node clustering task, and achieves state-of-the-art accuracy on the link prediction task for three standard datasets, cora, citeseer and pubmed. Code available at https://github.com/MysteryVaibhav/DW-GAE.

PDF Abstract

Results from the Paper


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Graph Clustering Citeseer RWR-GAE NMI 35.4 # 4
ACC 61.6 # 4
Graph Clustering Citeseer RWR-VGAE NMI 33.8 # 5
ACC 61.3 # 5
Graph Clustering Cora RWR-VGAE NMI 45.5 # 5
ACC 68.5 # 4
Graph Clustering Cora RWR-GAE NMI 48.1 # 4
ACC 66.9 # 5
Graph Clustering Pubmed RWR-VGAE NMI 34.6 # 2
ACC 73.6 # 2
Graph Clustering Pubmed RWR-GAE NMI 35.5 # 1
ACC 72.6 # 3

Methods


No methods listed for this paper. Add relevant methods here