Recommendations to boost content spread in social networks

WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web

Volumn , Issue , 2012, Pages 529-538

  Chaoji, Vineet ^a   Ranu, Sayan ^b   Rastogi, Rajeev ^a   Bhatt, Rushi ^a  

^a University of California   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

Content spread; Recommendation; Social networks

Indexed keywords

CONTENT SHARING; CONTENT SPREAD; NETWORK NODE; NOVEL ALGORITHM; RECOMMENDATION; SOCIAL GRAPHS; SOCIAL NETWORKS; SUBMODULAR; USER PROFILE;

APPROXIMATION ALGORITHMS; WORLD WIDE WEB;

SOCIAL NETWORKING (ONLINE);

EID: 84860853397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2187836.2187908     Document Type: Conference Paper

References (24)

1. Official Facebook Blog:. http://blog.facebook.com/blog.php?post= 15610312130.
2. Discovering who to follow. Official Twitter Blog. http://blog.twitter. com/2010/07/discovering-who-to-follow.html.
3. J. Chen, W. Geyer, C. Dugan, M. Muller, and I. Guy. Make new friends, but keep the old: recommending people on social networking sites. In CHI'09, pages 201-210, Boston, MA, USA, 2009.
4. W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD'10, pages 1029-1038, Washington, DC, USA, 2010.
5. W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD'09, pages 199-208, New York, NY, USA, 2009.
6. E. D. Demaine and M. Zadimoghaddam. Minimizing the diameter of a network using shortcut edges. In SWAT, pages 420-431, 2010.
7. P. Domingos and M. Richardson. Mining the network value of customers. In KDD'01, pages 57-66, San Francisco, California, 2001.
8. A. Ghosh and S. Boyd. Growing well-connected graphs. In Growing Well-connected Graphs, pages 6605 - 6611, 2006.
9. J. Goldenberg, B. Libai, and E. Muller. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters, pages 211-223, August 2001.
10. M. Granovetter. Threshold models of collective behavior. American Journal of Sociology, (83):1420-1443, 1978.
11. I. Guy, I. Ronen, and E. Wilcox. Do you know?: recommending people to invite into your social network. In IUI'09, pages 77-86, 2009.
12. J. Hannon, M. Bennett, and B. Smyth. Recommending twitter users to follow using content and collaborative filtering approaches. In RecSys'10, pages 199-206, 2010.
13. B. Huang and T. Jebara. Loopy belief propagation for bipartite maximum weight b-matching. In M. Meila and X. Shen, editors, AISTATS'07, volume 2 of JMLR: W&CP, March 2007.
14. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD'03, pages 137-146, Washington, D.C., 2003.
15. D. Kempe, J. M. Kleinberg, and E. Tardoś. Influential nodes in a diffusion model for social networks. In ICALP'05, pages 1127-1138, 2005.
16. J. Leskovec, D. Huttenlocher, and J. Kleinberg. Predicting positive and negative links in online social networks. In WWW'10, pages 641-650, 2010.
17. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD'07, pages 420-429, San Jose, California, USA, 2007.
18. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM'03, pages 556-559, New Orleans, LA, USA, 2003.
19. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
20. M. Roth, A. Ben-David, D. Deutscher, G. Flysher, I. Horn, A. Leichtberg, N. Leiser, Y. Matias, and R. Merom. Suggesting friends using the implicit social graph. In KDD'10, pages 233-242, Washington, DC, USA, 2010.
21. R. Schifanella, A. Barrat, C. Cattuto, B. Markines, and F. Menczer. Folks in folksonomies: social link prediction from shared metadata. In WSDM'10, pages 271-280, New York, NY, USA, 2010.
22. B. Suh, L. Hong, P. Pirolli, and E. H. Chi. Want to be retweeted? Large scale analytics on factors impacting retweet in twitter network. In SOCIALCOM'10, pages 177-184, Washington, DC, USA, 2010. IEEE Computer Society.
23. J. Vondŕak. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC, pages 67-74, 2008.
24. R. Zafarani and H. Liu. Social computing data repository at ASU, 2009.