How to Network in Online Social Networks

被引：0
作者：
Neglia, Giovanni [1 ]
Ye, Xiuhui [2 ]
Gabielkov, Maksym [1 ,3 ]
Legout, Arnaud [1 ,3 ]
机构：
[1] Inria Sophia Antipolis Mediterranee, Murray Hill, NJ 07974 USA
[2] Politecnico Torino, Turin, Italy
[3] Inria Sophia Antipolis Mediterranee, Biot, France
来源：
2014 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS) | 2014年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider how to maximize users' influence in Online Social Networks (OSNs) by exploiting social relationships only. Our first contribution is to extend to OSNs the model of Kempe et al. [1] on the propagation of information in a social network and to show that a greedy algorithm is a good approximation of the optimal algorithm that is NP-hard. However, the greedy algorithm requires global knowledge, which is hardly practical. Our second contribution is to show on simulations on the full Twitter social graph that simple and practical strategies perform close to the greedy algorithm.
引用
收藏
页码：819 / 824
页数：6
相关论文
共 11 条
[1]  
Barrat A., 2008, Dynamical Processes on Complex Networks
[2]  
Cha M., 2010, P AAAI ICWSM INT C W
[3]   Efficient Influence Maximization in Social Networks [J].
Chen, Wei ;
Wang, Yajun ;
Yang, Siyu .
KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, :199-207
[4]  
Domingos P., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P57, DOI 10.1145/502512.502525
[5]  
Gabielkov M., 2014, ACM SIGM 2014 AUST T
[6]  
Habiba, 2011, P IEEE ICDM 2011 WOR
[7]  
Kempe D., 2005, Automata, Languages and Programming. 32nd International Colloquium, ICALP 2005. Proceedings (Lecture Notes in Computer Science Vol. 3580), P1127, DOI 10.1007/11523468_91
[8]  
Kempe D., 2015, PROC ACM SIGKDD INT, V11, P105
[9]  
Neglia G., 2013, RR8423 INRIA
[10]  
Nemhauser G., 1988, Integer and Combinatorial Optimization, DOI DOI 10.1002/9781118627372
12