抑制假新闻在社交网络上的传播:基于影响最大化的监督方法

IF 1.9 Q3 COMPUTER SCIENCE, CYBERNETICS IEEE Systems Man and Cybernetics Magazine Pub Date : 2023-10-01 DOI:10.1109/msmc.2023.3276575
Nabamita Deb, Archana Kollu, Ali Alferaidi, Lulwah M. Alkwai, Pankaj Kumar
{"title":"抑制假新闻在社交网络上的传播:基于影响最大化的监督方法","authors":"Nabamita Deb, Archana Kollu, Ali Alferaidi, Lulwah M. Alkwai, Pankaj Kumar","doi":"10.1109/msmc.2023.3276575","DOIUrl":null,"url":null,"abstract":"With the continuous rise of various social media, the security problems caused by disseminating news in social networks have become increasingly prominent. Among them, the dissemination of false news has brought a significant threat to the security of cyberspace. A method based on influence maximization is proposed to change the premise of the false news in network space. This article employed the Louvain clustered local degree centrality (LCLD) and random maximum degree (RMD) algorithm to extract the most influential node set via influence maximization. Subsequently, TextCNN (convolutional neural network) was used to classify and identify false news and filter out several critical points in the node set. Then, the modified propagation network was repredicted by the prediction model. As a result, the spread of false news was significantly suppressed compared with the network before modification. Finally, the verification was carried out on Buzz Feed News’s real dataset. First, the information-based cascaded prediction model can more accurately fit the actual spread. Then the modified network was input into the prediction model for prediction, and the results show that the spread of false news can be suppressed. Finally, the influence maximization algorithm deletes several nodes containing incorrect information. It can effectively suppress the spread of false news, thus verifying the effectiveness of the proposed method.","PeriodicalId":43649,"journal":{"name":"IEEE Systems Man and Cybernetics Magazine","volume":"48 5 1","pages":"0"},"PeriodicalIF":1.9000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Suppressing the Spread of Fake News Over the Social Web of Things: An Influence Maximization-Based Supervised Approach\",\"authors\":\"Nabamita Deb, Archana Kollu, Ali Alferaidi, Lulwah M. Alkwai, Pankaj Kumar\",\"doi\":\"10.1109/msmc.2023.3276575\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the continuous rise of various social media, the security problems caused by disseminating news in social networks have become increasingly prominent. Among them, the dissemination of false news has brought a significant threat to the security of cyberspace. A method based on influence maximization is proposed to change the premise of the false news in network space. This article employed the Louvain clustered local degree centrality (LCLD) and random maximum degree (RMD) algorithm to extract the most influential node set via influence maximization. Subsequently, TextCNN (convolutional neural network) was used to classify and identify false news and filter out several critical points in the node set. Then, the modified propagation network was repredicted by the prediction model. As a result, the spread of false news was significantly suppressed compared with the network before modification. Finally, the verification was carried out on Buzz Feed News’s real dataset. First, the information-based cascaded prediction model can more accurately fit the actual spread. Then the modified network was input into the prediction model for prediction, and the results show that the spread of false news can be suppressed. Finally, the influence maximization algorithm deletes several nodes containing incorrect information. It can effectively suppress the spread of false news, thus verifying the effectiveness of the proposed method.\",\"PeriodicalId\":43649,\"journal\":{\"name\":\"IEEE Systems Man and Cybernetics Magazine\",\"volume\":\"48 5 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2023-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Systems Man and Cybernetics Magazine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/msmc.2023.3276575\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Man and Cybernetics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/msmc.2023.3276575","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

摘要

随着各种社交媒体的不断兴起,在社交网络中传播新闻所带来的安全问题日益突出。其中,虚假新闻的传播给网络空间安全带来了重大威胁。提出了一种基于影响力最大化的方法来改变网络空间中虚假新闻存在的前提。本文采用Louvain聚类局部度中心性(lld)和随机最大度(RMD)算法,通过影响最大化提取最具影响力的节点集。随后,使用TextCNN(卷积神经网络)对假新闻进行分类识别,并过滤掉节点集中的几个临界点。然后,利用预测模型对改进后的传播网络进行重新预测。因此,与修改前的网络相比,虚假新闻的传播得到了明显的抑制。最后,在Buzz Feed News的真实数据集上进行验证。首先,基于信息的级联预测模型可以更准确地拟合实际的传播。然后将改进后的网络输入到预测模型中进行预测,结果表明可以抑制虚假新闻的传播。最后,影响最大化算法删除包含错误信息的多个节点。它可以有效地抑制虚假新闻的传播,从而验证了所提出方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Suppressing the Spread of Fake News Over the Social Web of Things: An Influence Maximization-Based Supervised Approach
With the continuous rise of various social media, the security problems caused by disseminating news in social networks have become increasingly prominent. Among them, the dissemination of false news has brought a significant threat to the security of cyberspace. A method based on influence maximization is proposed to change the premise of the false news in network space. This article employed the Louvain clustered local degree centrality (LCLD) and random maximum degree (RMD) algorithm to extract the most influential node set via influence maximization. Subsequently, TextCNN (convolutional neural network) was used to classify and identify false news and filter out several critical points in the node set. Then, the modified propagation network was repredicted by the prediction model. As a result, the spread of false news was significantly suppressed compared with the network before modification. Finally, the verification was carried out on Buzz Feed News’s real dataset. First, the information-based cascaded prediction model can more accurately fit the actual spread. Then the modified network was input into the prediction model for prediction, and the results show that the spread of false news can be suppressed. Finally, the influence maximization algorithm deletes several nodes containing incorrect information. It can effectively suppress the spread of false news, thus verifying the effectiveness of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Systems Man and Cybernetics Magazine
IEEE Systems Man and Cybernetics Magazine COMPUTER SCIENCE, CYBERNETICS-
自引率
6.20%
发文量
60
期刊最新文献
Report of the First IEEE International Summer School (Online) on Environments—Classes, Agents, Roles, Groups, and Objects and Its Applications [Conference Reports] Saeid Nahavandi: Academic, Innovator, Technopreneur, and Thought Leader [Society News] IEEE Foundation IEEE Feedback Artificial Intelligence for the Social Internet of Things: Analysis and Modeling Using Collaborative Technologies [Special Section Editorial]
×
引用
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