Efficient Representation Learning Using Random Walks for Dynamic Graphs

1 code implementation • 5 Jan 2019 • Hooman Peiro Sajjad, Andrew Docherty, Yuriy Tyshetskiy

In this work, we propose computationally efficient algorithms for vertex representation learning that extend random walk based methods to dynamic graphs.

BIG-bench Machine Learning General Classification +1