Network Embedding Based on a Quasi-Local Similarity Measure

Network embedding based on the random walk and skip-gram model such as the DeepWalk and Node2Vec algorithms have received wide attention. We identify that these algorithms essentially estimate the node similarities by random walk simulation, which is unreliable, inefficient, and inflexible. We propose to explicitly use node similarity measures instead of random walk simulation. Based on this strategy and a new proposed similarity measure, we present a fast and scalable algorithm AA(+)Emb. Experiments show that AA(+)Emb outperforms state-of-the-art network embedding algorithms on several commonly used benchmark networks.