DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks
Wang, Biao (Shanghai Jiao Tong University) | Chen, Ge (Shanghai Jiao Tong University) | Fu, Luoyi (Shanghai Jiao Tong University) | Song, Li (Shanghai Jiao Tong University) | Wang, Xinbing (Shanghai Jiao Tong University) | Liu, Xue (McGill University)
Rumor blocking is a serious problem in large-scale social networks. Malicious rumors could cause chaos in society and hence need to be blocked as soon as possible after being detected. In this paper, we propose a model of dynamic rumor influence minimization with user experience (DRIMUX). Our goal is to minimize the influence of the rumor (i.e., the number of users that have accepted and sent the rumor) by blocking a certain subset of nodes. A dynamic Ising propagation model considering both the global popularity and individual attraction of the rumor is presented based on realistic scenario. In addition, different from existing problems of influence minimization, we take into account the constraint of user experience utility. Specifically, each node is assigned a tolerance time threshold. If the blocking time of each user exceeds that threshold, the utility of the network will decrease. Under this constraint, we then formulate the problem as a network inference problem with survival theory, and propose solutions based on maximum likelihood principle. Experiments are implemented based on large-scale real world networks and validate the effectiveness of our method.
Apr-19-2016
- Country:
- Asia > China (0.14)
- North America
- Canada (0.14)
- United States (0.14)
- Industry:
- Information Technology > Services (0.65)
- Technology: