Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

RWR-GAE: Random Walk Regularization for Graph Auto Encoders

About

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.

Vaibhav, Po-Yao Huang, Robert Frederking• 2019

Related benchmarks

TaskDatasetResultRank
Link PredictionCora (test)
AUC0.929
69
Link PredictionPubMed (test)
AUC96.2
65
Link PredictionCiteseer (test)
AUC0.923
31
Node ClusteringCiteseer (test)
Accuracy61.6
17
Node ClusteringCora (test)
Accuracy68.5
17
Node ClusteringPubMed (test)
Accuracy73.6
13
Showing 6 of 6 rows

Other info

Code

Follow for update