N odeS ig: Random Walk Diffusion meets Hashing for Scalable Graph Embeddings

10/01/2020
by   Abdulkadir Çelikkanat, et al.
0

Learning node representations is a crucial task with a plethora of interdisciplinary applications. Nevertheless, as the size of the networks increases, most widely used models face computational challenges to scale to large networks. While there is a recent effort towards designing algorithms that solely deal with scalability issues, most of them behave poorly in terms of accuracy on downstream tasks. In this paper, we aim at studying models that balance the trade-off between efficiency and accuracy. In particular, we propose N odeS ig, a scalable embedding model that computes binary node representations. N odeS ig exploits random walk diffusion probabilities via stable random projection hashing, towards efficiently computing embeddings in the Hamming space. Our extensive experimental evaluation on various graphs has demonstrated that the proposed model achieves a good balance between accuracy and efficiency compared to well-known baseline models on two downstream tasks.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset