February 9–12, 2011, Hong Kong, China | Lars Backstrom, Jure Leskovec
The paper "Supervised Random Walks: Predicting and Recommending Links in Social Networks" by Lars Backstrom addresses the challenge of predicting and recommending links in social networks. The authors develop an algorithm called Supervised Random Walks, which combines network structure with node and edge attributes to predict future interactions. The algorithm learns a function that assigns strengths to edges, guiding a random walk on the graph to visit nodes that are likely to form new links. Experiments on Facebook and large collaboration networks show that the approach outperforms state-of-the-art unsupervised and feature-based methods. The paper also discusses the challenges of link prediction, including the sparsity of real networks and the interaction between network and node features. The authors propose a supervised learning task to learn edge strengths and present an efficient training algorithm. The method is validated on synthetic data and real-world datasets, demonstrating its effectiveness in predicting and recommending links.The paper "Supervised Random Walks: Predicting and Recommending Links in Social Networks" by Lars Backstrom addresses the challenge of predicting and recommending links in social networks. The authors develop an algorithm called Supervised Random Walks, which combines network structure with node and edge attributes to predict future interactions. The algorithm learns a function that assigns strengths to edges, guiding a random walk on the graph to visit nodes that are likely to form new links. Experiments on Facebook and large collaboration networks show that the approach outperforms state-of-the-art unsupervised and feature-based methods. The paper also discusses the challenges of link prediction, including the sparsity of real networks and the interaction between network and node features. The authors propose a supervised learning task to learn edge strengths and present an efficient training algorithm. The method is validated on synthetic data and real-world datasets, demonstrating its effectiveness in predicting and recommending links.