4.7 Article

Node deletion-based algorithm for blocking maximizing on negative influence from uncertain sources

期刊

KNOWLEDGE-BASED SYSTEMS
卷 231, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.knosys.2021.107451

关键词

Linear threshold model; Social network; Negative influence blocking

资金

  1. Chinese National Natural Science Foundation [61972335, 61872312, 61379066, 61702441, 61472344, 61402395, 61906100, 61602202]
  2. Natural Science Foundation of Jiangsu Province [BK20201430]
  3. Jiangsu Provincial Graduate Education Innovation Project [KYCX19_2097]

向作者/读者索取更多资源

This study focuses on maximizing blocking of negative influence from uncertain sources in social networks. It proposes a competitive influence linear threshold propagation model and defines the uncertain negative source influence blocking maximization problem based on this model. An algorithm is introduced for node deletion-based blocking, showing improved efficiency compared to other methods.
The spreading of negative influence, such as epidemic, rumor, false information and computer virus, may lead to serious consequences in social networks. The issue of negative influence blocking maximization arouses intense interest of the researchers. However, in the real world social network environment, the exact source of negative influence is usually unknown. In most cases, we only know the distribution of negative seeds, which is the probability for each node to be a negative seed. In this work, we investigate the problem of maximizing the blocking on negative influence from uncertain sources. We propose the competitive influence linear threshold propagation model (CI-LTPM) for the problem. Based on the IC-LTPM model, we define the problem of uncertain negative source influence blocking maximization (UNS-IBM). We use the propagation tree in the live-edge (LE) sub-graph for estimating the influence propagation. An algorithm is proposed to calculate the blocking increments of the positive seeds based on the propagation tree in the LE sub-graph. We observed that the blocking effect of the positive seeds is the reduction on the negative influence after the positive seeds and their related edges being deleted from the LE sub-graph. Based on such observation, we propose a node deletion-based algorithm NDB (node-deletion-blocking) for solving the UNS-IBM problem. Our experiment results show that NDB can block more negative influence in less computational time than other methods. (C) 2021 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据