Stochastic bilevel interdiction for fake news control in online social networks

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-10-18 DOI:10.1016/j.cor.2024.106872
Kati Moug , Siqian Shen
{"title":"Stochastic bilevel interdiction for fake news control in online social networks","authors":"Kati Moug ,&nbsp;Siqian Shen","doi":"10.1016/j.cor.2024.106872","DOIUrl":null,"url":null,"abstract":"<div><div>Social media platforms attempt to mitigate and control fake news, using interventions such as flagging posts or adjusting newsfeed algorithms, to protect vulnerable individuals. In this paper, we consider performing intervention actions on specific source nodes or user–user edges in social networks, under uncertain effectiveness of different intervention strategies. We model misinformation from malicious users to vulnerable communities using stochastic network interdiction formulations. Specifically, we minimize the expected number of reachable vulnerable users via stochastic maximum flow, and develop an alternative formulation for handling large-scale social networks based on their topological structures. We derive theoretical results for path-based networks and develop an approximate algorithm for single-edge removal on paths. We test instances of a social network with 23,505 nodes, based on the IMDb actors dataset, to demonstrate the scalability of the approach and its effectiveness. Via numerical studies, we find that characteristics of removed edges change when intervention effectiveness is stochastic. Our results suggest that intervention should target on (i) a smaller set of centrally located edges with nodes that represent communities where regulatory actions are more effective, and (ii) dispersed edges with nodes where intervention has a high chance of failure.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106872"},"PeriodicalIF":4.1000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003447","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Social media platforms attempt to mitigate and control fake news, using interventions such as flagging posts or adjusting newsfeed algorithms, to protect vulnerable individuals. In this paper, we consider performing intervention actions on specific source nodes or user–user edges in social networks, under uncertain effectiveness of different intervention strategies. We model misinformation from malicious users to vulnerable communities using stochastic network interdiction formulations. Specifically, we minimize the expected number of reachable vulnerable users via stochastic maximum flow, and develop an alternative formulation for handling large-scale social networks based on their topological structures. We derive theoretical results for path-based networks and develop an approximate algorithm for single-edge removal on paths. We test instances of a social network with 23,505 nodes, based on the IMDb actors dataset, to demonstrate the scalability of the approach and its effectiveness. Via numerical studies, we find that characteristics of removed edges change when intervention effectiveness is stochastic. Our results suggest that intervention should target on (i) a smaller set of centrally located edges with nodes that represent communities where regulatory actions are more effective, and (ii) dispersed edges with nodes where intervention has a high chance of failure.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在线社交网络中假新闻控制的随机双层拦截法
社交媒体平台试图通过标记帖子或调整新闻推送算法等干预措施来减少和控制假新闻,从而保护易受攻击的个人。在本文中,我们考虑在不同干预策略效果不确定的情况下,对社交网络中的特定源节点或用户-用户边缘采取干预行动。我们使用随机网络拦截公式对恶意用户向弱势社群发布的错误信息进行建模。具体来说,我们通过随机最大流量最小化可接触到的易受攻击用户的预期数量,并根据大规模社交网络的拓扑结构开发了一种处理大规模社交网络的替代方案。我们推导出了基于路径网络的理论结果,并开发出了在路径上去除单边的近似算法。我们测试了基于 IMDb 演员数据集的 23,505 个节点的社交网络实例,以证明该方法的可扩展性和有效性。通过数值研究,我们发现当干预效果是随机的时,被移除的边的特征会发生变化。我们的研究结果表明,干预的目标应是:(i) 较小的集中边缘,其节点代表监管行动更有效的社区;(ii) 分散边缘,其节点代表干预失败几率较高的社区。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Editorial Board A literature review of reinforcement learning methods applied to job-shop scheduling problems An accelerated Benders decomposition method for distributionally robust sustainable medical waste location and transportation problem Lexicographic optimization-based approaches to learning a representative model for multi-criteria sorting with non-monotonic criteria Portfolio optimisation: Bridging the gap between theory and practice
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1