A Malicious Information Popularity Prediction Model Based on User Influence

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2025-02-20 DOI:10.1109/TSC.2025.3544122
Tun Li;Yan Tang;Rong Xie;Yuqi Weng;Qian Li;Rong Wang;Chaolong Jia;Yunpeng Xiao
{"title":"A Malicious Information Popularity Prediction Model Based on User Influence","authors":"Tun Li;Yan Tang;Rong Xie;Yuqi Weng;Qian Li;Rong Wang;Chaolong Jia;Yunpeng Xiao","doi":"10.1109/TSC.2025.3544122","DOIUrl":null,"url":null,"abstract":"In social networks, studying methods for predicting the popularity of malicious information can help improve the ability to predict online public opinion. This paper proposes a malicious information popularity prediction model based on user influence, targeting the cooperative adversarial nature of malicious information propagation, the problem of assessing user influence in malicious information propagation space, and the complexity of malicious information propagation space. First, regarding the cooperative adversarial nature of the malicious information propagation process, considering that user behavior is influenced by both malicious and positive information during the propagation process, evolutionary game theory and multiple linear regression are introduced, and internal and external behavioral factors of the user are synthesized to construct influential functions that quantify malicious information and positive information. Meanwhile, the influence matrix is introduced when quantifying information to construct a weighted malicious information propagation network further. Second, regarding the problem of assessing user influence in the malicious information propagation space, considering the advantages of PageRank in measuring the importance of web pages and combining the timeliness of malicious information propagation, an improved algorithm T-PageRank (Timeliness-PageRank) based on timeliness is proposed. Introducing the time decay factor into the PageRank algorithm effectively enhances the accuracy and timeliness of the influence assessment of malicious information propagation. Finally, regarding the complexity of the propagation space of malicious information and considering that Graph Attention Network (GAT) can effectively capture complex relationships between nodes, combined with user influence, a malicious information popularity prediction model based on GAT is constructed. The model learns the complex interaction between users by using GAT and updates the feature representation of users so that it can be used for subsequent malicious information popularity prediction tasks. The experiment shows that the model can not only accurately assess the influence of users but also effectively predict the popularity of malicious information propagation.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 2","pages":"543-556"},"PeriodicalIF":5.8000,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10896826/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In social networks, studying methods for predicting the popularity of malicious information can help improve the ability to predict online public opinion. This paper proposes a malicious information popularity prediction model based on user influence, targeting the cooperative adversarial nature of malicious information propagation, the problem of assessing user influence in malicious information propagation space, and the complexity of malicious information propagation space. First, regarding the cooperative adversarial nature of the malicious information propagation process, considering that user behavior is influenced by both malicious and positive information during the propagation process, evolutionary game theory and multiple linear regression are introduced, and internal and external behavioral factors of the user are synthesized to construct influential functions that quantify malicious information and positive information. Meanwhile, the influence matrix is introduced when quantifying information to construct a weighted malicious information propagation network further. Second, regarding the problem of assessing user influence in the malicious information propagation space, considering the advantages of PageRank in measuring the importance of web pages and combining the timeliness of malicious information propagation, an improved algorithm T-PageRank (Timeliness-PageRank) based on timeliness is proposed. Introducing the time decay factor into the PageRank algorithm effectively enhances the accuracy and timeliness of the influence assessment of malicious information propagation. Finally, regarding the complexity of the propagation space of malicious information and considering that Graph Attention Network (GAT) can effectively capture complex relationships between nodes, combined with user influence, a malicious information popularity prediction model based on GAT is constructed. The model learns the complex interaction between users by using GAT and updates the feature representation of users so that it can be used for subsequent malicious information popularity prediction tasks. The experiment shows that the model can not only accurately assess the influence of users but also effectively predict the popularity of malicious information propagation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于用户影响力的恶意信息流行度预测模型
在社交网络中,研究恶意信息流行度的预测方法有助于提高网络舆情预测能力。针对恶意信息传播的协同对抗特性、恶意信息传播空间中用户影响力评估问题以及恶意信息传播空间的复杂性,提出了一种基于用户影响力的恶意信息流行度预测模型。首先,针对恶意信息传播过程的合作对抗性质,考虑到用户行为在传播过程中同时受到恶意信息和积极信息的影响,引入进化博弈论和多元线性回归,综合用户内外行为因素,构建量化恶意信息和积极信息的影响函数。同时,在量化信息时引入影响矩阵,进一步构建加权恶意信息传播网络。其次,针对恶意信息传播空间中用户影响力评估问题,考虑到PageRank在衡量网页重要性方面的优势,结合恶意信息传播的时效性,提出了一种基于时效性的改进算法T-PageRank (timelineness -PageRank)。在PageRank算法中引入时间衰减因子,有效提高了恶意信息传播影响评估的准确性和时效性。最后,针对恶意信息传播空间的复杂性,考虑到图注意网络(GAT)能够有效捕捉节点间的复杂关系,结合用户影响,构建了基于GAT的恶意信息流行度预测模型。该模型利用GAT学习用户之间复杂的交互,并更新用户的特征表示,以便于后续的恶意信息流行度预测任务。实验表明,该模型不仅能准确评估用户的影响,还能有效预测恶意信息传播的流行程度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
NER-AD: Noise-Robust Reconstruction Enhanced by Representation-Learning for Metric Anomaly Detection in Online Service Systems Decentralized Load Balancing in Urban Edge computing with Spatial Modeling Age-Aware Big Data Query Evaluation for Analytic Services in Serverless Edge Clouds PMLSF: A Privacy-Preserving Machine Learning Service Framework for Efficient Task Allocation in Mobile Crowdsensing Online Microservice Deployment in Edge Networks via Multiobjective Deep Reinforcement Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1