M Ou, P Cui, Z Zhang, J Pei, W Zhu. SIGKDD 2016
In this paper, we aim to preserve asymmetric transitivity in directed graphs by approximating high-order proximities. We propose a scalable approximation algorithm, called High Order Proximity preserved Embedding (HOPE). In this algorithm, we first derive a general formulation of a class of high-order proximity measurements, then apply generalized SVD to the general formulation, whose time complexity is linear with the size of graph. The empirical study demonstrates the superiority of asymmetric transitivity and our proposed algorithm.