.png){kind=icon}
返回
Influence Minimization Algorithm Based on Coordination Game
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2939571.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Influence analysis is the basic technology for predicting potentially hazardous behavior and determining the traceability of the hazardous behavior in the public security domain. Previous research has focused on maximizing the diffusion of the influence; however, little research has been performed on the method of minimizing the influence of negative information dissemination in networks. This paper proposes an influence minimization algorithm based on coordinated game. When the negative information is generated in the network and some initial nodes have been infected, the goal is to minimize the number of the final infected nodes by discovering and blocking the K uninfected nodes. First, the algorithm assumes that the behavior of the node propagating information depends on the coordination game with its neighboring nodes. Second, based on the local interaction model between the nodes, this paper quantifies the level of the infiuence of a node that is affected by its neighbors. Finally, the heuristic algorithm is used to identify the approximate optimal solution. The results of experiments performed on four real network datasets show that the proposed algorithm can suppress negative information diffusion better than the five considered existing algorithms.
Keyword:
Social network
influence minimization
coordination game
negative information
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
查看更多内容