RumorDecay: Rumor Dissemination Interruption for Target Recipients in Social Networks
RumorDecay: Rumor Dissemination Interruption for Target Recipients in Social Networks
复制标题
DOI：
10.1109/tsmc.2022.3144141
复制
发表时间：
2022-10
期刊：
影响因子：
--
通讯作者：
Zhongyuan Jiang;Xianyu Chen;Jianfeng Ma;P. Yu
中科院分区：
文献类型：
--
作者：
Zhongyuan Jiang;Xianyu Chen;Jianfeng Ma;P. Yu
在无处不在的社交媒体上迅速传播的谣言（即某一地区出现不真实的新冠肺炎疫情的说法）很容易引起公众恐慌，并使许多非常敏感的个体（即目标接受者）产生非理性行为（例如服用不必要的药物）。因此，对这些目标受众的谣言控制或屏蔽是非常关键的，这与传统的保护所有个体的方式不同，到目前为止仍然是一个开放和具有挑战性的问题。在这项工作中，我们首先从数学上定义了一个一般目标信息传播（TID）模型，并进行了理论证明，基于谣言从给定的来源通过多条路径传播到目标接收者，这些路径可能会因删除几个被称为保护器的关键环节而明显中断。其次，在TID模型的基础上，引入随机游走算法对谣言接收者的传播路径进行抽样。第三，为了在大量选择的路径中有效地删除一组预算有限的保护器，以减少或削弱谣言对目标接收者的负面影响，我们提出了一种基于启发式策略的谣言影响衰减机制，即RumorDecay（即本文中的RumorDecay $k$ hop最近邻法和RumorDecay $k$ hop随机漫步法），该机制可以快速有效地定位到最优的保护器。最后，我们在许多真实的社交网络上进行了大量的实验，结果表明，RumorDecay策略可以在较少的时间成本下显著削弱谣言的传播能力。
Rumors (i.e., untrue emergence saying of COVID-19 in an area) that rapidly disseminate on the ubiquitous social media easily cause public panics and irrational behaviors (e.g., taking unnecessary medicine) of many very sensitive individuals referred to as target recipients. Thus, rumor controlling or blocking for these target recipients is very critical, which differs from the traditional way of protecting all individuals and remains an open and challenging problem so far. In this work, on the basis that rumors are disseminated from the given sources to target recipients via multiple paths which may be significantly interrupted by deleting a few key links referred to as protectors, we first mathematically define a general target information disseminating (TID) model and do theoretical proofs. Second, based on the TID model, we introduce a random walk algorithm to sample the paths of rumor dissemination for recipients. Third, aiming at deleting a budget-limited set of protectors efficiently in a large number of selected paths to reduce or weaken the negative rumor influences on the target recipients, we propose a heuristical strategy-based rumor influence decay mechanism referred to as RumorDecay (i.e., RumorDecay $k$ hop nearest neighbor method and RumorDecay $k$ hop random walk method in this work) which can locate the optimal protectors quickly and efficiently. Finally, we conduct extensive experiments on many real social networks and the results show that the RumorDecay strategy can significantly weaken the rumor dissemination ability with less time cost.