Supervised random walks: Predicting and recommending links in social networks

Proceedings of the 4th ACM International Conference on Web Search and Data Mining, WSDM 2011

Volumn , Issue , 2011, Pages 635-644

  Backstrom, Lars ^a   Leskovec, Jure ^b  

^a FACEBOOK   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Link prediction; Social networks

Indexed keywords

ATTRIBUTE DATA; COLLABORATION NETWORK; FACEBOOK; FUNDAMENTAL PROBLEM; LINK PREDICTION; NETWORK STRUCTURES; RANDOM WALK; RANDOM WALKERS; SOCIAL GRAPHS; SOCIAL NETWORKS; STRENGTH ESTIMATION; TRAINING ALGORITHMS; UNSUPERVISED APPROACHES;

ALGORITHMS; COMBINES; DATA MINING; FEATURE EXTRACTION; FORECASTING; INFORMATION RETRIEVAL; RANDOM PROCESSES; SOCIAL NETWORKING (ONLINE);

WORLD WIDE WEB;

EID: 79952402158     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1935826.1935914     Document Type: Conference Paper

References (32)

1. L. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211-230, 2003. (Pubitemid 36831776)
2. A. Agarwal and S. Chakrabarti. Learning random walks to rank nodes in graphs. In ICML '07, pages 9-16, 2007.
3. A. Agarwal, S. Chakrabarti, and S. Aggarwal. Learning to rank networked entities. In KDD '06, pages 14-23, 2006.
4. A. Andrew. Iterative computation of derivatives of eigenvalues and eigenvectors. IMA Journal of Applied Mathematics, 24(2): 209-218, 1979.
5. A. L. Andrew. Convergence of an iterative method for derivatives of eigensystems. Journal of Computational Physics, 26: 107-112, 1978.
6. 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.
7. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286: 509-512, 1999.
8. A. Blum, H. Chan, and M. Rwebangira. A random-surfer web-graph model. In ANALCO '06, 2006.
9. 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. (Pubitemid 351630323)
10. J. Coleman. Social Capital in the Creation of Human Capital. The American Journal of Sociology, 94: S95-S120, 1988.
11. M. Diligenti, M. Gori, and M. Maggini. Learning web page scores by error back-propagation. In IJCAI '05, 2005.
12. J. Gehrke, P. Ginsparg, and J. M. Kleinberg. Overview of the 2003 kdd cup. SIGKDD Explorations, 5(2): 149-151, 2003.
13. M. Gomez-Rodriguez, J. Leskovec, and A. Krause. Inferring networks of diffusion and influence. In KDD '10, 2010.
14. M. S. Granovetter. The strength of weak ties. American Journal of Sociology, 78: 1360-1380, 1973.
15. T. H. Haveliwala. Topic-sensitive pagerank. In WWW '02, pages 517-526, 2002.
16. K. Henderson and T. Eliassi-Rad. Applying latent dirichlet allocation to group discovery in large graphs. In SAC '09, pages 1456-1461.
17. G. Jeh and J. Widom. Scaling personalized web search. In WWW '03, pages 271-279, 2003.
18. 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.
19. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In KDD '08, pages 462-470, 2008.
20. 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.
21. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03, pages 556-559, 2003.
22. D. Liu and J. Nocedal. On the limited memory bfgs method for large scale optimization. Mathematical Programming, 45: 503-528, 1989. 10.1007/BF01589116. (Pubitemid 20660315)
23. 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.
24. S. Myers and J. Leskovec. On the convexity of latent social network inference. In NIPS '10, 2010.
25. 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.
26. A. Popescul, R. Popescul, and L. H. Ungar. Statistical relational learning for link prediction, 2003.
27. P. Sarkar and A. W. Moore. Fast dynamic reranking in large graphs. In WWW '09, pages 31-40, 2009.
28. B. Taskar, M. F. Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In NIPS '03, 2003.
29. H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. In KDD '06, pages 404-413, 2006.
30. H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In KDD '07, pages 747-756, 2007.
31. T. Tong, C. Faloutsos, and J.-Y Pan. Fast randomwalk with restart and its applications. In ICDM '06, 2006.
32. 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.