DeepWalk is an approach to learn latent representations of graphs by treating short random walks as sentences in a language modeling framework. It learns the representations by predicting context vertices using the Skip-Gram model. DeepWalk represents each vertex in a graph as a d-dimensional feature vector learned from random walks in the graph. It scales to large graphs and outperforms other methods on network classification tasks using representations as features.