Maximizing acceptance probability for active friending in online social networks

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn Part F128815, Issue , 2013, Pages 713-721

  Yang, De Nian ^a   Hung, Hui Ju ^a   Lee, Wang Chien ^b   Chen, Wei ^c  

^a ACADEMIA SINICA   (Taiwan)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

Friending; Social influence; Social network

Indexed keywords

AIR NAVIGATION; DATA MINING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBABILITY; TREES (MATHEMATICS);

FRIENDING; ON-LINE SOCIAL NETWORKS; ONLINE SOCIAL NETWORKINGS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; PROVIDE GUIDANCES; SOCIAL INFLUENCE;

SOCIAL NETWORKING (ONLINE);

EID: 84962053885     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487599     Document Type: Conference Paper

References (32)

1. http://money.cnn.com/2012/10/03/technology/social/facebook-promoted-posts/index.html.
2. V. Chaoji, S. Ranu, R. Rastogi, and R. Bhatt. Recommendations to boost content spread in social networks. In Proc. WWW, pages 529-538, 2012.
3. J. Chen, W. Geyer, C. Dugan, M. J. Muller, and I. Guy. Make new friends, but keep the old: Recommending people on social networking sites. In CHI, pages 201-210, 2009.
4. W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu, D. Rincon, X. Sun, Y. Wang, W. Wei, and Y. Yuan. Influence maximization in social networks when negative opinions may emerge and propagate. In SDM, pages 379-390, 2011.
5. W. Chen, W. Lu, and N. Zhang. Time-critical influence maximization in social networks with time-delayed diffusion process. In AAAI, 2012.
6. W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, pages 1029-1038, 2010.
7. W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM, pages 88-97, 2010.
8. J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-index: Towards verification-free query processing on graph databases. In SIGMOD, pages 857-872, 2007.
9. R. B. Cialdini and N. J. Goldstein. Social influence: Compliance and conformity. Annual Review of Psychology, 55:591-621, 2004.
10. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937-946, 2002.
11. W. Fan, J. Li, S. Ma, H. Wang, and Y. Wu. Graph homomorphism revisited for graph matching. In VLDB, pages 1161-1172, 2010.
12. T. L. Fond and J. Neville. Randomization tests for distinguishing social influence and homophily effects. In WWW, pages 601-610, 2010.
13. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning influence probabilities in social networks. In WSDM, pages 241-250, 2010.
14. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. A data-based approach to social influence maximization. In VLDB, pages 73-84, 2011.
15. I. Guy, N. Zwerdling, D. Carmel, I. Ronen, E. Uziel, S. Yogev, and S. Ofek-Koifman. Personalized recommendation of social software items based on social relations. In RecSys, pages 53-60, 2009.
16. S. Hangal, D. MacLean, M. S. Lam, and J. Heer. All friends are not equal: Using weights in social graphs to improve search. In Proc. SNA-KDD Workshop, 2010.
17. D. Kempe, J. M. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003.
18. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. M. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In KDD, pages 420-429, 2007.
19. K. Macropol and A. K. Singh. Scalable discovery of best clusters on large graphs. In VLDB, pages 693-702, 2010.
20. P. V. Marsden and N. E. Friedkin. Network studies of social influence. Sociological Methods & Research, 22(1):127-151, 1993.
21. M. McPherson, L. Smith-Lovin, and J. M. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, pages 415-444, 2001.
22. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC, pages 29-42, 2007.
23. R. Ronen and O. Shmueli. Evaluating very large datalog queries on social networks. In EDBT, pages 577-587, 2009.
24. K. Saito, R. Nakano, and M. Kimura. Prediction of information diffusion probabilities for independent cascade model. In KES, pages 67-75, 2008.
25. E. Spertus, M. Sahami, and O. Buyukkokten. Evaluating similarity measures: A large-scale study in the orkut social network. In KDD, pages 678-684, 2005.
26. J. Tang, H. Gao, X. Hu, and H. Liu. Exploiting homophily effect for trust prediction. In WSDM, pages 53-62, 2013.
27. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In WOSN, pages 37-42, 2009.
28. Z. Wen and C.-Y. Lin. On the quality of inferring interests from social neighbors. In KDD, pages 373-382, 2010.
29. B. Xu, A. Chin, H. Wang, and L. Zhang. Social linking and physical proximity in a mobile location-based service. In Proc. Ubicomp, pages 1-10, 2011.
30. D.-N. Yang, H.-J. Hung, W.-C. Lee, and W. Chen. Maximizing acceptance probability for active friending in on-line social networks. CoRR, abs/1302.7025, 2013.
31. S.-H. Yang, A. J. Smola, B. Long, H. Zha, and Y. Chang. Friend or frenemy?: Predicting signed ties in social networks. In SIGIR, pages 555-564, 2012.
32. G. K. Zipf. Human behavior and the principle of least effort. Addison-Wesley Press, 1949.