Topic-aware social influence propagation models

被引:172
作者
Barbieri, Nicola [1 ]
Bonchi, Francesco [1 ]
Manco, Giuseppe [2 ]
机构
[1] Yahoo Res, Web Min Res Grp, Barcelona, Spain
[2] ICAR CNR, Cosenza, Italy
关键词
Social influence; Topic modeling; Topic-aware propagation model; Viral marketing;
D O I
10.1007/s10115-013-0646-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The study of influence-driven propagations in social networks and its exploitation for viral marketing purposes has recently received a large deal of attention. However, regardless of the fact that users authoritativeness, expertise, trust and influence are evidently topic-dependent, the research on social influence has surprisingly largely overlooked this aspect. In this article, we study social influence from a topic modeling perspective. We introduce novel topic-aware influence-driven propagation models that, as we show in our experiments, are more accurate in describing real-world cascades than the standard (i.e., topic-blind) propagation models studied in the literature. In particular, we first propose simple topic-aware extensions of the well-known Independent Cascade and Linear Threshold models. However, these propagation models have a very large number of parameters which could lead to overfitting. Therefore, we propose a different approach explicitly modeling authoritativeness, influence and relevance under a topic-aware perspective. Instead of considering user-to-user influence, the proposed model focuses on user authoritativeness and interests in a topic, leading to a drastic reduction in the number of parameters of the model. We devise methods to learn the parameters of the models from a data set of past propagations. Our experimentation confirms the high accuracy of the proposed models and learning schemes.
引用
收藏
页码:555 / 584
页数:30
相关论文
共 30 条
[21]  
Kimura M, 2006, LECT NOTES ARTIF INT, V4213, P259
[22]  
Lin X, 2011, P IEEE INT C DAT MIN
[23]  
Liu L, 2010, P 19 ACM C INF KNOWL
[24]  
Mathioudakis M, 2011, P 17 ACM SIGKDD INT
[25]  
McCallum A, 1999, IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, P662
[26]   ANALYSIS OF APPROXIMATIONS FOR MAXIMIZING SUBMODULAR SET FUNCTIONS .1. [J].
NEMHAUSER, GL ;
WOLSEY, LA ;
FISHER, ML .
MATHEMATICAL PROGRAMMING, 1978, 14 (03) :265-294
[27]  
Richardson Matthew, 2002, P 8 ACM SIGKDD INT C
[28]  
Saito K., 2008, P 12 INT C KNOWL BAS
[29]   Efficient discovery of influential nodes for SIS models in social networks [J].
Saito, Kazumi ;
Kimura, Masahiro ;
Ohara, Kouzou ;
Motoda, Hiroshi .
KNOWLEDGE AND INFORMATION SYSTEMS, 2012, 30 (03) :613-635
[30]  
Weng J, 2010, P 3 INT C WEB SEARCH