DeepAI AI Chat
Log In Sign Up

RWR-GAE: Random Walk Regularization for Graph Auto Encoders

by   Vaibhav, et al.

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


page 1

page 2

page 3

page 4


Variational Graph Normalized Auto-Encoders

Link prediction is one of the key problems for graph-structured data. Wi...

Kernel Node Embeddings

Learning representations of nodes in a low dimensional space is a crucia...

Transformation of Node to Knowledge Graph Embeddings for Faster Link Prediction in Social Networks

Recent advances in neural networks have solved common graph problems suc...

Learning Networks from Random Walk-Based Node Similarities

Digital presence in the world of online social media entails significant...

A Broader Picture of Random-walk Based Graph Embedding

Graph embedding based on random-walks supports effective solutions for m...

TGE-PS: Text-driven Graph Embedding with Pairs Sampling

In graphs with rich text information, constructing expressive graph repr...

Force2Vec: Parallel force-directed graph embedding

A graph embedding algorithm embeds a graph into a low-dimensional space ...