当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Community-based rumor blocking maximization in social networks: Algorithms and analysis
Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-09-10 , DOI: 10.1016/j.tcs.2020.08.030
Qiufen Ni; Jianxiong Guo; Chuanhe Huang; Weili Wu

Social networks provide us a convenient platform to communicate and share information or ideas with each other, but it also causes many negative effects at the same time, such as, the spread of misinformation or rumor in social networks may cause public panic and even serious economic or political crisis. In this paper, we propose a Community-based Rumor Blocking Problem (CRBMP), i.e., selecting a set of seed users from all communities as protectors with the constraint of budget b such that the expected number of users eventually not being influenced by rumor sources is maximized. We consider the community structure in social networks and solve our problem in two stages, in the first stage, we allocate budget b for all the communities, this sub-problem whose objective function is proved to be monotone and DR-submodular, so we can use the method of submodular function maximization on an integer lattice, which is different from most of the existing work with the submodular function over a set function. Then a greedy community budget allocation algorithm is devised to get an 11/e approximation ratio; we also propose a speed-up greedy algorithm which greatly reduces the time complexity for the community budget allocation and can get an 11/eϵ approximation guarantee meanwhile. Next we solve the Protector Seed Selection (PSS) problem in the second stage after we obtained the budget allocation vector for communities, we greedily choose protectors for each community with the budget constraints to achieve the maximization of the influence of protectors. The greedy algorithm for PSS problem can achieve a 1/2 approximation guarantee. We also consider a special case where the rumor just originates from one community and does not spread out of its own community before the protectors are selected, the proposed algorithm can reduce the computational cost than the general greedy algorithm since we remove the uninfected communities. Finally, we conduct extensive experiments on three real world data sets, the results demonstrate the effectiveness of the proposed algorithm and its superiority over other methods.

更新日期:2020-09-15

 

全部期刊列表>>
物理学研究前沿热点精选期刊推荐
科研绘图
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
自然职场线上招聘会
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
张晓晨
田蕾蕾
李闯创
刘天飞
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
X-MOL
清华大学
廖矿标
陈永胜
试剂库存
down
wechat
bug