BiasedWalk: Biased Sampling for Representation Learning on Graphs - CentraleSupélec Access content directly
Conference Papers Year : 2018

BiasedWalk: Biased Sampling for Representation Learning on Graphs


Network embedding algorithms are able to learn latent feature representations of nodes, transforming networks into lower dimensional vector representations. Typical key applications, which have effectively been addressed using network embeddings, include link prediction, multilabel classification and community detection. In this paper, we propose Biased-Walk, a scalable, unsupervised feature learning algorithm that is based on biased random walks to sample context information about each node in the network. Our random-walk based sampling can behave as Breath-First-Search (BFS) and Depth-First-Search (DFS) samplings with the goal to capture homophily and role equivalence between the nodes in the network. We have performed a detailed experimental evaluation comparing the performance of the proposed algorithm against various baseline methods, on several datasets and learning tasks. The experiment results show that the proposed method outperforms the baseline ones in most of the tasks and datasets.
Fichier principal
Vignette du fichier
BiasedWalk.pdf (334.51 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01958902 , version 1 (18-12-2018)



Duong Nguyen, Fragkiskos Malliaros. BiasedWalk: Biased Sampling for Representation Learning on Graphs. International Workshop on High Performance Big Graph Data Management, Analysis, and Mining (BigGraphs), Dec 2018, Seattle, WA, United States. ⟨10.1109/bigdata.2018.8621872⟩. ⟨hal-01958902⟩
225 View
714 Download



Gmail Mastodon Facebook X LinkedIn More