EN FR
EN FR
New Software and Platforms
Bilateral Contracts and Grants with Industry
Bibliography
New Software and Platforms
Bilateral Contracts and Grants with Industry
Bibliography


Section: New Results

Representation Learning on Real-World Graphs

Participants: Fragkiskos Malliaros, Abdulkadir Çelikkanat (in collaboration with Duong Nguyen, UC San Diego)

Network representation learning (NRL) methods aim to map each vertex into a low dimensional space by preserving both local and global structure of a given network. In recent years, various approaches based on random walks have been proposed to learn node embeddings – thanks to their success in several challenging problems. In this work, we have introduced two methodologies to compute latent representations of nodes based on random walks.

In particular, we have proposed BiasedWalk, an unsupervised Skip-gram-based network embedding algorithm which can preserve higher-order proximity information, as well as capture both the homophily and role equivalence relationships between nodes [33]. BiasedWalk relies on a novel node sampling procedure based on biased random walks, that can behave as actual depth-first-search and breath-first-search explorations – thus, forcing the sampling scheme to capture both role equivalence and homophily relations between nodes. Furthermore, BiasedWalk is scalable on large scale graphs, and is able to handle different types of networks structures, including (un)weighted and (un)directed ones.

Furthermore, we have introduced TNE (Topical Node Embeddings), a general framework to enhance node embeddings acquired by means of the random walk-based approaches [45]. Similar to the notion of topical word embeddings in the domain of Natural Language Processing, the proposed framework assigns each vertex to a topic with the favor of various statistical models and community detection methods, and then generates enhanced community representations.

We have evaluated our methods on two downstream tasks: node classification and link prediction in social, information and biological networks. The experimental results demonstrate that the biased random walks as well as the incorporation of vertex and topic embeddings outperform widely-known baseline NRL methods.