Rumor Detection with Bidirectional Graph Attention Networks

Xiaohui Yang, Hailong Ma, Miao Wang
{"title":"Rumor Detection with Bidirectional Graph Attention Networks","authors":"Xiaohui Yang, Hailong Ma, Miao Wang","doi":"10.1155/2022/4840997","DOIUrl":null,"url":null,"abstract":"In order to extract the relevant features of rumors effectively, this paper proposes a novel rumor detection model with bidirectional graph attention network on the basis of constructing a directed graph, named P-BiGAT. Firstly, this model builds the propagation tree and diffusion tree through the tweet comment and reposting relationship. Secondly, the improved graph attention network (GAT) is used to extract the propagation feature and the diffusion feature through two different directions, and the multihead attention mechanism is used to extract the semantic information of the source tweet. Finally, the propagation feature, diffusion feature, and semantic information representation of the source tweet are connected together through a fully connected layer, and the mapping function is used to determine the authenticity of the information. In addition, this paper also proposes a new node update method and applies it to the model in order to select neighbor node information effectively. Specifically, it can select the neighbor information node with larger weight to update the node according to the weight of the neighbor node. The results of the experiment show that the model is better than the baseline method of comparison in accuracy, precision, recall, and F1 measure on the public datasets.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Secur. Commun. Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/4840997","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In order to extract the relevant features of rumors effectively, this paper proposes a novel rumor detection model with bidirectional graph attention network on the basis of constructing a directed graph, named P-BiGAT. Firstly, this model builds the propagation tree and diffusion tree through the tweet comment and reposting relationship. Secondly, the improved graph attention network (GAT) is used to extract the propagation feature and the diffusion feature through two different directions, and the multihead attention mechanism is used to extract the semantic information of the source tweet. Finally, the propagation feature, diffusion feature, and semantic information representation of the source tweet are connected together through a fully connected layer, and the mapping function is used to determine the authenticity of the information. In addition, this paper also proposes a new node update method and applies it to the model in order to select neighbor node information effectively. Specifically, it can select the neighbor information node with larger weight to update the node according to the weight of the neighbor node. The results of the experiment show that the model is better than the baseline method of comparison in accuracy, precision, recall, and F1 measure on the public datasets.
基于双向图注意网络的谣言检测
为了有效地提取谣言的相关特征,本文在构造有向图的基础上,提出了一种新的具有双向图注意网络的谣言检测模型,命名为P-BiGAT。首先,该模型通过推文评论和转发关系构建传播树和扩散树。其次,利用改进的图注意网络(GAT)提取两个不同方向的传播特征和扩散特征,并利用多头注意机制提取源推文的语义信息。最后,通过全连接层将源tweet的传播特征、扩散特征和语义信息表示连接在一起,并利用映射函数确定信息的真实性。此外,本文还提出了一种新的节点更新方法,并将其应用于模型中,以有效地选择相邻节点信息。具体来说,它可以选择权重较大的邻居信息节点,根据邻居节点的权重更新节点。实验结果表明,在公共数据集上,该模型在准确率、精密度、召回率和F1测度等方面都优于基线比较方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信