Learning Representations using Spectral-Biased Random Walks on Graphs

by   Charu Sharma, et al.

Several state-of-the-art neural graph embedding methods are based on short random walks (stochastic processes) because of their ease of computation, simplicity in capturing complex local graph properties, scalability, and interpretibility. In this work, we are interested in studying how much a probabilistic bias in this stochastic process affects the quality of the nodes picked by the process. In particular, our biased walk, with a certain probability, favors movement towards nodes whose neighborhoods bear a structural resemblance to the current node's neighborhood. We succinctly capture this neighborhood as a probability measure based on the spectrum of the node's neighborhood subgraph represented as a normalized laplacian matrix. We propose the use of a paragraph vector model with a novel Wasserstein regularization term. We empirically evaluate our approach against several state-of-the-art node embedding techniques on a wide variety of real-world datasets and demonstrate that our proposed method significantly improves upon existing methods on both link prediction and node classification tasks.



There are no comments yet.


page 1

page 2

page 3

page 4


Residual2Vec: Debiasing graph embedding with random graphs

Graph embedding maps a graph into a convenient vector-space representati...

Accurately Modeling Biased Random Walks on Weighted Graphs Using Node2vec+

Node embedding is a powerful approach for representing the structural ro...

Supervised Q-walk for Learning Vector Representation of Nodes in Networks

Automatic feature learning algorithms are at the forefront of modern day...

Compatibility, embedding and regularization of non-local random walks on graphs

Several variants of the graph Laplacian have been introduced to model no...

Walk Extraction Strategies for Node Embeddings with RDF2Vec in Knowledge Graphs

As KGs are symbolic constructs, specialized techniques have to be applie...

Graph Neighborhood Attentive Pooling

Network representation learning (NRL) is a powerful technique for learni...

A Self-Attention Network based Node Embedding Model

Despite several signs of progress have been made recently, limited resea...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.