Centrality-aware link recommendations

WSDM 2016 - Proceedings of the 9th ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2016, Pages 503-512

  Parotsidis, Nikos ^a   Pitoura, Evaggelia ^b   Tsaparas, Panayiotis ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Link recommendations; Node centrality; Probabilistic networks; Social networks

Indexed keywords

ALGORITHMS; DATA MINING; INFORMATION RETRIEVAL; OPTIMIZATION; SOCIAL NETWORKING (ONLINE); WEBSITES; WORLD WIDE WEB;

APPROXIMATION RATIOS; BUILDING BLOCKES; GREEDY ALGORITHMS; LINK RECOMMENDATIONS; NODE CENTRALITY; OPTIMIZATION FUNCTION; PROBABILISTIC NETWORK; SPECIFIC PROPERTIES;

APPROXIMATION ALGORITHMS;

EID: 84964389651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2835776.2835818     Document Type: Conference Paper

References (25)

1. L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3), 2003.
2. L. Backstrom and J. Leskovec. Supervised random walks: predicting and recommending links in social networks. In WSDM, pages 635-644, 2011.
3. V. Chaoji, S. Ranu, R. Rastogi, and R. Bhatt. Recommendations to boost content spread in social networks. In WWW, pages 529-538, 2012.
4. P. Crescenzi, G. D' Angelo, L. Severini, and Y. Velaj. Greedily improving our own centrality in a network. In SEA, pages 43-55. 2015.
5. D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.
6. H. Frank. Shortest paths in probabilistic graphs. Operations Research, 17(4):583-599, 1969.
7. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10(1):57-77, 1985.
8. V. Ishakian, D. Erdös, E. Terzi, and A. Bestavros. A framework for the evaluation and management of network centrality. In SDM, pages 427-438, 2012.
9. G. Kollios, M. Potamias, and E. Terzi. Clustering large probabilistic graphs. IEEE Trans. Knowl. Data Eng., 25(2):325-336, 2013.
10. K. Lazaridou, K. Semertzidis, E. Pitoura, and P. Tsaparas. Identifying converging pairs of nodes on a budget. In EDBT, 2015.
11. M. Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In SPIRE, 2002.
12. D. Li, Z. Xu, S. Li, X. Sun, A. Gupta, and K. Sycara. Link recommendation for promoting information diffusion in social networks. In WWW (Companion Volume), 2013.
13. D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019-1031, 2007.
14. D. Liben-Nowell and J. M. Kleinberg. The link prediction problem for social networks. In ACM CIKM, pages 556-559, 2003.
15. A. Meyerson and B. Tagiku. Minimizing average shortest path distances via shortcut edge addition. In APPROX, pages 272-285, 2009.
16. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, pages 265-294, 1978.
17. M. Papagelis. Refining social graph connectivity via shortcut edge addition. TKDD, 10(2):12, 2015.
18. M. Papagelis, F. Bonchi, and A. Gionis. Suggesting ghost edges for a smaller world. In CIKM, pages 2305-2308. ACM, 2011.
19. N. Parotsidis, E. Pitoura, and P. Tsaparas. Selecting shortcuts for a smaller world. In SDM, 2015.
20. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. K-nearest neighbors in uncertain graphs. Proceedings of the VLDB Endowment, 3(1-2):997-1008, 2010.
21. A. E. Sariyüce, K. Kaya, E. Saule, and Ü. V. Çatalyürek. Incremental algorithms for network management and analysis based on closeness centrality. CoRR, abs/1303.0422, 2013.
22. H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos. Gelling, and melting, large graphs by edge manipulation. In CIKM, pages 245-254, 2012.
23. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
24. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In WOSN, pages 37-42, 2009.
25. Z. Yin, M. Gupta, T. Weninger, and J. Han. A unified framework for link recommendation using random walks. In ASONAM, pages 152-159, 2010.