Supervised Random Walks: Predicting and Recommending Links in Social Networks

11/17/2010
by   L. Backstrom, et al.
0

Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near future or which existing interactions are we missing. Although this problem has been extensively studied, the challenge of how to effectively combine the information from the network structure with rich node and edge attribute data remains largely open. We develop an algorithm based on Supervised Random Walks that naturally combines the information from the network structure with node and edge level attributes. We achieve this by using these attributes to guide a random walk on the graph. We formulate a supervised learning task where the goal is to learn a function that assigns strengths to edges in the network such that a random walker is more likely to visit the nodes to which new links will be created in the future. We develop an efficient training algorithm to directly learn the edge strength estimation function. Our experiments on the Facebook social graph and large collaboration networks show that our approach outperforms state-of-the-art unsupervised approaches as well as approaches that are based on feature extraction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2012

Latent Multi-group Membership Graph Model

We develop the Latent Multi-group Membership Graph (LMMG) model, a model...
research
10/10/2019

Link Prediction via Deep Learning

Link prediction aims to infer the missing links or predicting future one...
research
01/25/2022

Link Prediction with Contextualized Self-Supervision

Link prediction aims to infer the existence of a link between two nodes ...
research
05/20/2021

A Preference Random Walk Algorithm for Link Prediction through Mutual Influence Nodes in Complex Networks

Predicting links in complex networks has been one of the essential topic...
research
10/17/2021

POLE: Polarized Embedding for Signed Networks

From the 2016 U.S. presidential election to the 2021 Capitol riots to th...
research
03/28/2019

Distributed Algorithms for Fully Personalized PageRank on Large Graphs

Personalized PageRank (PPR) has enormous applications, such as link pred...
research
03/11/2019

Learning Edge Properties in Graphs from Path Aggregations

Graph edges, along with their labels, can represent information of funda...

Please sign up or login with your details

Forgot password? Click here to reset