潜伏者:基于后门攻击的可解释的在线媒体谣言检测。

IF 2.6 4区 综合性期刊 Q2 MULTIDISCIPLINARY SCIENCES
Yao Lin, Wenhui Xue, Congrui Bai, Jing Li, Xiaoyan Yin, Chase Q Wu
{"title":"潜伏者:基于后门攻击的可解释的在线媒体谣言检测。","authors":"Yao Lin, Wenhui Xue, Congrui Bai, Jing Li, Xiaoyan Yin, Chase Q Wu","doi":"10.1177/00368504241307816","DOIUrl":null,"url":null,"abstract":"<p><p>Because of their proficiency in capturing the category characteristics of graphs, graph neural networks have shown remarkable advantages for graph-level classification tasks, that is, rumor detection and anomaly detection. Due to the manipulation of special means (e.g. bots) on online media, rumors may spread across the whole network at an overwhelming speed. Compared with normal information, popular rumors usually have a special propagation structure, especially in the early stage of information dissemination. More specifically, the special propagation structure determines whether rumors can be spread successfully. Namely, online users and their interaction that constitute the special propagation structure play a key role in the spread of rumors. Therefore, the problem of rumor detection can be transformed into detecting the existence of a special propagation structure. Inspired by backdoor attacks, we propose an interpretable rumor detection algorithm based on backdoor. Firstly, based on causal analysis, the causal sub-graph that determines the category of the graph (rumor vs. normal information) is obtained, that is, the critical online users in the rumor spreading effect are found, and then the specific propagation structure is explored. Finally, the special propagation structure is planted into the rumor detection model as a trigger. Experimental results and performance analysis on three real-world datasets demonstrate the effectiveness of our proposed algorithm in the special propagation structure detection of rumors. Compared with two baselines, <i>Lurker</i> achieves up to 33.1% and 61.8% performance improvement in terms of attack success rate and clean accuracy drop.</p>","PeriodicalId":56061,"journal":{"name":"Science Progress","volume":"108 1","pages":"368504241307816"},"PeriodicalIF":2.6000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11705316/pdf/","citationCount":"0","resultStr":"{\"title\":\"Lurker: Backdoor attack-based explainable rumor detection on online media.\",\"authors\":\"Yao Lin, Wenhui Xue, Congrui Bai, Jing Li, Xiaoyan Yin, Chase Q Wu\",\"doi\":\"10.1177/00368504241307816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Because of their proficiency in capturing the category characteristics of graphs, graph neural networks have shown remarkable advantages for graph-level classification tasks, that is, rumor detection and anomaly detection. Due to the manipulation of special means (e.g. bots) on online media, rumors may spread across the whole network at an overwhelming speed. Compared with normal information, popular rumors usually have a special propagation structure, especially in the early stage of information dissemination. More specifically, the special propagation structure determines whether rumors can be spread successfully. Namely, online users and their interaction that constitute the special propagation structure play a key role in the spread of rumors. Therefore, the problem of rumor detection can be transformed into detecting the existence of a special propagation structure. Inspired by backdoor attacks, we propose an interpretable rumor detection algorithm based on backdoor. Firstly, based on causal analysis, the causal sub-graph that determines the category of the graph (rumor vs. normal information) is obtained, that is, the critical online users in the rumor spreading effect are found, and then the specific propagation structure is explored. Finally, the special propagation structure is planted into the rumor detection model as a trigger. Experimental results and performance analysis on three real-world datasets demonstrate the effectiveness of our proposed algorithm in the special propagation structure detection of rumors. Compared with two baselines, <i>Lurker</i> achieves up to 33.1% and 61.8% performance improvement in terms of attack success rate and clean accuracy drop.</p>\",\"PeriodicalId\":56061,\"journal\":{\"name\":\"Science Progress\",\"volume\":\"108 1\",\"pages\":\"368504241307816\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2025-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11705316/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Science Progress\",\"FirstCategoryId\":\"103\",\"ListUrlMain\":\"https://doi.org/10.1177/00368504241307816\",\"RegionNum\":4,\"RegionCategory\":\"综合性期刊\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Science Progress","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.1177/00368504241307816","RegionNum":4,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

摘要

由于图神经网络能够熟练地捕捉图的类别特征,因此在图级分类任务(即谣言检测和异常检测)中显示出显著的优势。由于网络媒体上的特殊手段(如机器人)的操纵,谣言可能会以压倒性的速度在全网传播。与正常信息相比,流行谣言通常具有特殊的传播结构,特别是在信息传播的早期。更具体地说,特殊的传播结构决定了谣言能否成功传播。即网络用户及其互动构成了特殊的传播结构,在谣言的传播中起着关键作用。因此,可以将谣言检测问题转化为检测是否存在一个特殊的传播结构。受后门攻击的启发,我们提出了一种基于后门的可解释谣言检测算法。首先,在因果分析的基础上,得到确定图(谣言与正常信息)类别的因果子图,即找到谣言传播效果中的关键在线用户,然后探索具体的传播结构。最后,将特定的传播结构作为触发因素植入谣言检测模型中。在三个真实数据集上的实验结果和性能分析表明,本文算法在谣言的特殊传播结构检测中是有效的。与两个基线相比,Lurker在攻击成功率和干净准确率下降方面的性能提高了33.1%和61.8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Lurker: Backdoor attack-based explainable rumor detection on online media.

Because of their proficiency in capturing the category characteristics of graphs, graph neural networks have shown remarkable advantages for graph-level classification tasks, that is, rumor detection and anomaly detection. Due to the manipulation of special means (e.g. bots) on online media, rumors may spread across the whole network at an overwhelming speed. Compared with normal information, popular rumors usually have a special propagation structure, especially in the early stage of information dissemination. More specifically, the special propagation structure determines whether rumors can be spread successfully. Namely, online users and their interaction that constitute the special propagation structure play a key role in the spread of rumors. Therefore, the problem of rumor detection can be transformed into detecting the existence of a special propagation structure. Inspired by backdoor attacks, we propose an interpretable rumor detection algorithm based on backdoor. Firstly, based on causal analysis, the causal sub-graph that determines the category of the graph (rumor vs. normal information) is obtained, that is, the critical online users in the rumor spreading effect are found, and then the specific propagation structure is explored. Finally, the special propagation structure is planted into the rumor detection model as a trigger. Experimental results and performance analysis on three real-world datasets demonstrate the effectiveness of our proposed algorithm in the special propagation structure detection of rumors. Compared with two baselines, Lurker achieves up to 33.1% and 61.8% performance improvement in terms of attack success rate and clean accuracy drop.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Science Progress
Science Progress Multidisciplinary-Multidisciplinary
CiteScore
3.80
自引率
0.00%
发文量
119
期刊介绍: Science Progress has for over 100 years been a highly regarded review publication in science, technology and medicine. Its objective is to excite the readers'' interest in areas with which they may not be fully familiar but which could facilitate their interest, or even activity, in a cognate field.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信