A prediction model for rumor user propagation behavior based on sparse representation and transfer learning

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yunpeng Xiao, Yu Zhang, Cong Zeng, Tun Li, Rong Wang, Qian Li, Chaolong Jia
{"title":"A prediction model for rumor user propagation behavior based on sparse representation and transfer learning","authors":"Yunpeng Xiao,&nbsp;Yu Zhang,&nbsp;Cong Zeng,&nbsp;Tun Li,&nbsp;Rong Wang,&nbsp;Qian Li,&nbsp;Chaolong Jia","doi":"10.1016/j.ins.2024.120590","DOIUrl":null,"url":null,"abstract":"<div><p>This paper introduces a prediction model rooted in sparse representation and transfer learning, with the primary objective of predicting user behavior during rumor propagation. Users' behavior is dynamic, and rumor, rumor-refuting, and rumor-promoting messages interact dynamically, according to the model. Firstly, this paper proposes to compensate for the low performance of propagation prediction models due to data sparsity at the beginning of rumor topics' lifes. Transfer learning is used to compensate for the data sparsity problem at the beginning of the topic. To map the rumor topic space effectively, a low-rank dense vectorization algorithm based on sparse representation is proposed. Finally, to mine the potential impact of multiple types of information on users, a model based on three-party game theory is constructed. It considers the complex interaction between rumor, rumor-refuting, and rumor-promoting information in the propagation of rumor. Additionally, this paper develops a model of dynamic user behavior prediction using Rumor-Attention-Mechanism-Graph-Attention (RAM-GAT) to predict rumor propagation. Experiments demonstrate that our model can effectively mine the interaction influence between multiple types of information. It can accurately predict user behavior when initial data is insufficient. In addition, rumor propagation patterns and trends are revealed.</p></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.1000,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524005036","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper introduces a prediction model rooted in sparse representation and transfer learning, with the primary objective of predicting user behavior during rumor propagation. Users' behavior is dynamic, and rumor, rumor-refuting, and rumor-promoting messages interact dynamically, according to the model. Firstly, this paper proposes to compensate for the low performance of propagation prediction models due to data sparsity at the beginning of rumor topics' lifes. Transfer learning is used to compensate for the data sparsity problem at the beginning of the topic. To map the rumor topic space effectively, a low-rank dense vectorization algorithm based on sparse representation is proposed. Finally, to mine the potential impact of multiple types of information on users, a model based on three-party game theory is constructed. It considers the complex interaction between rumor, rumor-refuting, and rumor-promoting information in the propagation of rumor. Additionally, this paper develops a model of dynamic user behavior prediction using Rumor-Attention-Mechanism-Graph-Attention (RAM-GAT) to predict rumor propagation. Experiments demonstrate that our model can effectively mine the interaction influence between multiple types of information. It can accurately predict user behavior when initial data is insufficient. In addition, rumor propagation patterns and trends are revealed.

基于稀疏表示和迁移学习的谣言用户传播行为预测模型
本文介绍了一种基于稀疏表示和迁移学习的预测模型,其主要目的是预测谣言传播过程中的用户行为。用户行为是动态的,根据模型,谣言、辟谣信息和谣传信息是动态交互的。首先,本文提出了如何弥补传播预测模型在谣言话题生命初期因数据稀疏而导致的低性能。迁移学习用于弥补话题初期的数据稀疏问题。为了有效映射谣言话题空间,提出了一种基于稀疏表示的低秩密集向量算法。最后,为了挖掘多种类型信息对用户的潜在影响,我们构建了一个基于三方博弈论的模型。该模型考虑了谣言传播过程中谣言信息、辟谣信息和促谣信息之间复杂的互动关系。此外,本文还利用谣言-关注-机制-图谱-关注(RAM-GAT)建立了一个动态用户行为预测模型,以预测谣言的传播。实验证明,我们的模型能有效挖掘多种类型信息之间的交互影响。当初始数据不足时,它能准确预测用户行为。此外,我们还揭示了谣言传播的模式和趋势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术官方微信