RWR-GAE: Random Walk Regularization for Graph Auto Encoders
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Aug 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 4; 2023: 1; 2024: 2; 2025: 2.
10 papers.
- 2021Graph-based Semi-supervised Learning: A Comprehensive Reviewcited by 79
- 2023Beyond Homophily: Reconstructing Structure for Graph-agnostic Clusteringcited by 29
- 2022A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resourcecited by 26
- 2022Modularity-Aware Graph Autoencoders for Joint Community Detection and Link Predictioncited by 22
- 2024Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clusteringcited by 6
- 2024Provable Filter for Real-world Graph Clusteringcited by 5
- 2022Relating graph auto-encoders to linear modelscited by 2
- 2022New Frontiers in Graph Autoencoders: Joint Community Detection and Link Predictioncited by 1
- 2025Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passingcited by 0
- 2025Attention Beyond Neighborhoods: Reviving Transformer for Graph Clusteringcited by 0
- 2025Attention Beyond Neighborhoods: Reviving Transformer for Graph Clustering18 Sep 2025
- 2025Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing27 Jul 2025
- 2024Provable Filter for Real-world Graph Clustering6 Mar 2024
- 2024Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering12 Jan 2024
- 2023Beyond Homophily: Reconstructing Structure for Graph-agnostic Clustering3 May 2023
- 2022A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource23 Nov 2022
- 2022New Frontiers in Graph Autoencoders: Joint Community Detection and Link Prediction16 Nov 2022
- 2022Relating graph auto-encoders to linear models3 Nov 2022
- 2022Modularity-Aware Graph Autoencoders for Joint Community Detection and Link Prediction2 Feb 2022
- 2021Graph-based Semi-supervised Learning: A Comprehensive Review26 Feb 2021