Lars Backstrom
Jure Leskovec
ABSTRACT
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.
- L. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211--230, 2003.Google Scholar
Cross Ref
- A. Agarwal and S. Chakrabarti. Learning random walks to rank nodes in graphs. In ICML '07, pages 9--16, 2007. Google ScholarDigital Library
- A. Agarwal, S. Chakrabarti, and S. Aggarwal. Learning to rank networked entities. In KDD '06, pages 14--23, 2006. Google ScholarDigital Library
- A. Andrew. Iterative computation of derivatives of eigenvalues and eigenvectors. IMA Journal of Applied Mathematics, 24(2):209--218, 1979.Google ScholarCross Ref
- A. L. Andrew. Convergence of an iterative method for derivatives of eigensystems. Journal of Computational Physics, 26:107--112, 1978.Google ScholarCross Ref
- L. Backstrom, D. P. Huttenlocher, J. M. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD '06, pages 44--54, 2006. Google ScholarDigital Library
- A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.Google ScholarCross Ref
- A. Blum, H. Chan, and M. Rwebangira. A random-surfer web-graph model. In ANALCO '06, 2006.Google ScholarCross Ref
- A. Clauset, C. Moore, and M. E. J. Newman. Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191):98--101, May 2008.Google ScholarCross Ref
- J. Coleman. Social Capital in the Creation of Human Capital. The American Journal of Sociology, 94:S95--S120, 1988.Google ScholarCross Ref
- M. Diligenti, M. Gori, and M. Maggini. Learning web page scores by error back--propagation. In IJCAI '05, 2005. Google ScholarDigital Library
- J. Gehrke, P. Ginsparg, and J. M. Kleinberg. Overview of the 2003 kdd cup. SIGKDD Explorations, 5(2):149--151, 2003. Google ScholarDigital Library
- M. Gomez-Rodriguez, J. Leskovec, and A. Krause. Inferring networks of diffusion and influence. In KDD '10, 2010.Google ScholarDigital Library
- M. S. Granovetter. The strength of weak ties. American Journal of Sociology, 78:1360-1380, 1973.Google ScholarCross Ref
- T. H. Haveliwala. Topic-sensitive pagerank. In WWW '02, pages 517--526, 2002. Google ScholarDigital Library
- K. Henderson and T. Eliassi-Rad. Applying latent dirichlet allocation to group discovery in large graphs. In SAC '09, pages 1456--1461. Google ScholarDigital Library
- G. Jeh and J. Widom. Scaling personalized web search. In WWW '03, pages 271--279, 2003. Google ScholarDigital Library
- R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In FOCS '00, page 57, 2000. Google ScholarDigital Library
- J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In KDD '08, pages 462--470, 2008. Google ScholarDigital Library
- J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05, pages 177--187, 2005. Google ScholarDigital Library
- D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03, pages 556--559, 2003. Google ScholarDigital Library
- D. Liu and J. Nocedal. On the limited memory bfgs method for large scale optimization. Mathematical Programming, 45:503--528, 1989. 10.1007/BF01589116. Google ScholarDigital Library
- R. Minkov and W. W. Cohen. Learning to rank typed graph walks: Local and global approaches. In WebKDD/SNA-KDD '07, pages 1--8, 2007. Google ScholarDigital Library
- S. Myers and J. Leskovec. On the convexity of latent social network inference. In NIPS '10, 2010.Google Scholar
- L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Dig. Lib. Tech. Proj., 1998.Google Scholar
- A. Popescul, R. Popescul, and L. H. Ungar. Statistical relational learning for link prediction, 2003.Google Scholar
- P. Sarkar and A. W. Moore. Fast dynamic reranking in large graphs. In WWW '09, pages 31--40, 2009. Google ScholarDigital Library
- B. Taskar, M. F. Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In NIPS '03, 2003.Google Scholar
- H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. In KDD '06, pages 404--413, 2006. Google ScholarDigital Library
- H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In KDD '07, pages 747--756, 2007. Google ScholarDigital Library
- T. Tong, C. Faloutsos, and J.-Y. Pan. Fast randomwalk with restart and its applications. In ICDM '06, 2006. Google ScholarDigital Library
- L. Yan, R. Dodier, M. Mozer, and R. Wolniewicz. Optimizing classifier performance via an approximation to the wilcoxon-mann-whitney statistic. In ICML '03, pages 848--855, 2003.Google Scholar
Index Terms
- Supervised random walks: predicting and recommending links in social networks
Recommendations
A supervised learning approach for link prediction in complex social networks
In the current scenario, social networking is being used for social and business purpose such as Facebook, Twitter, and LinkedIn. Social networking websites are attracting the focus of many researchers. New links are being created in every fraction of a ...
Link Prediction Across Multiple Social Networks
ICDMW '10: Proceedings of the 2010 IEEE International Conference on Data Mining WorkshopsThe problem of link prediction has been studied extensively in literature. There are various versions of the link prediction problem \textit{e.g.,} link existence problem, link removal problem, predicting edge weights over time etc. In this paper we ...
Enhancing Link Prediction in Twitter using Semantic User Attributes
ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015Studying social networks and the ties connecting people in those networks has attracted many researchers. Social networks like Facebook, Twitter and Flickr require efficient and accurate methods to recommend friends to their users in the network. ...
Comments