Random walks are at the heart of many existing deep learning algorithms for graph data. However, such algorithms have many limitations that arise from the use of random walks, e.g., the features resulting from these methods are unable to transfer to new nodes and graphs as they are tied to node identity. In this work, we introduce the notion of attributed random walks which serves as a basis for generalizing existing methods such as DeepWalk, node2vec, and many others that leverage random walks. Our proposed framework enables these methods to be more widely applicable for both transductive and inductive learning as well as for use on graphs with attributes (if available). This is achieved by learning functions that generalize to new nodes and graphs. We show that our proposed framework is effective with an average AUC improvement of 16.1% while requiring on average 853 times less space than existing methods on a variety of graphs from several domains.

本论文介绍了带标记的随机游走的概念，以此为基础对现有的一些利用随机游走的算法如DeepWalk、node2vec等进行了推广，可适用于传导学习、归纳学习以及具备属性的图形数据，并在多个领域的各种图形上验证了该算法的有效性。

基于图的表示学习方法泛化框架