贝叶斯推理和蚁群优化用于在线社交网络的多谣言缓解

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Soft Computing Pub Date : 2024-07-31 DOI:10.1007/s00500-024-09810-z
Priyanka Parimi, Rashmi Ranjan Rout
{"title":"贝叶斯推理和蚁群优化用于在线社交网络的多谣言缓解","authors":"Priyanka Parimi, Rashmi Ranjan Rout","doi":"10.1007/s00500-024-09810-z","DOIUrl":null,"url":null,"abstract":"<p>With the increasing popularity of social media, Online Social Networks (OSNs) are being used for promoting or discrediting various products or persons. As such, rumors are spread in the networks to increase or decrease the popularity of the target. Limiting the spread of rumors is an important research problem. In a promotion or smear campaign, we see multiple rumors about the target. Many existing works have explored rumor propagation and mitigation in social networks for a single rumor. However, users become biased towards the topic due to multiple rumors about it. A user influenced by the previous rumors about a topic is more likely to believe a rumor with similar content. Therefore, in this work, we analyze the spread of multiple rumors about a topic and formulate an optimization problem to identify the top <i>k</i> rumor spreaders. A Bayesian Inference has been applied to model the user bias caused by multiple rumors based on rumor content and user opinion about the topic. An Adaptive Ant Colony Optimization algorithm has been proposed to determine the top <i>k</i> rumor spreaders, who may be isolated from the network to reduce the impact of the rumors in the OSN. The efficacy of the proposed approaches is shown through experimentation on two datasets by considering the budget <i>k</i>.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"8 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bayesian inference and ant colony optimization for multi-rumor mitigation in online social networks\",\"authors\":\"Priyanka Parimi, Rashmi Ranjan Rout\",\"doi\":\"10.1007/s00500-024-09810-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>With the increasing popularity of social media, Online Social Networks (OSNs) are being used for promoting or discrediting various products or persons. As such, rumors are spread in the networks to increase or decrease the popularity of the target. Limiting the spread of rumors is an important research problem. In a promotion or smear campaign, we see multiple rumors about the target. Many existing works have explored rumor propagation and mitigation in social networks for a single rumor. However, users become biased towards the topic due to multiple rumors about it. A user influenced by the previous rumors about a topic is more likely to believe a rumor with similar content. Therefore, in this work, we analyze the spread of multiple rumors about a topic and formulate an optimization problem to identify the top <i>k</i> rumor spreaders. A Bayesian Inference has been applied to model the user bias caused by multiple rumors based on rumor content and user opinion about the topic. An Adaptive Ant Colony Optimization algorithm has been proposed to determine the top <i>k</i> rumor spreaders, who may be isolated from the network to reduce the impact of the rumors in the OSN. The efficacy of the proposed approaches is shown through experimentation on two datasets by considering the budget <i>k</i>.</p>\",\"PeriodicalId\":22039,\"journal\":{\"name\":\"Soft Computing\",\"volume\":\"8 1\",\"pages\":\"\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00500-024-09810-z\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00500-024-09810-z","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

随着社交媒体的日益普及,在线社交网络(OSN)被用来宣传或诋毁各种产品或个人。因此,谣言在网络中传播,以提高或降低目标的受欢迎程度。限制谣言的传播是一个重要的研究课题。在促销或抹黑活动中,我们会看到关于目标的多种谣言。现有的许多研究都针对单一谣言探讨了社交网络中的谣言传播和缓解问题。然而,由于存在多个谣言,用户会对话题产生偏见。受之前关于某个话题的谣言影响,用户更有可能相信内容相似的谣言。因此,在这项工作中,我们分析了关于一个话题的多个谣言的传播情况,并提出了一个优化问题,以确定前 k 个谣言传播者。根据谣言内容和用户对话题的看法,我们采用贝叶斯推理方法对多个谣言造成的用户偏差进行建模。还提出了一种自适应蚁群优化算法来确定前 k 个谣言传播者,并将其从网络中隔离出来,以减少谣言在 OSN 中的影响。通过对两个数据集进行实验,考虑预算 k,展示了所提方法的功效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Bayesian inference and ant colony optimization for multi-rumor mitigation in online social networks

With the increasing popularity of social media, Online Social Networks (OSNs) are being used for promoting or discrediting various products or persons. As such, rumors are spread in the networks to increase or decrease the popularity of the target. Limiting the spread of rumors is an important research problem. In a promotion or smear campaign, we see multiple rumors about the target. Many existing works have explored rumor propagation and mitigation in social networks for a single rumor. However, users become biased towards the topic due to multiple rumors about it. A user influenced by the previous rumors about a topic is more likely to believe a rumor with similar content. Therefore, in this work, we analyze the spread of multiple rumors about a topic and formulate an optimization problem to identify the top k rumor spreaders. A Bayesian Inference has been applied to model the user bias caused by multiple rumors based on rumor content and user opinion about the topic. An Adaptive Ant Colony Optimization algorithm has been proposed to determine the top k rumor spreaders, who may be isolated from the network to reduce the impact of the rumors in the OSN. The efficacy of the proposed approaches is shown through experimentation on two datasets by considering the budget k.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Soft Computing
Soft Computing 工程技术-计算机:跨学科应用
CiteScore
8.10
自引率
9.80%
发文量
927
审稿时长
7.3 months
期刊介绍: Soft Computing is dedicated to system solutions based on soft computing techniques. It provides rapid dissemination of important results in soft computing technologies, a fusion of research in evolutionary algorithms and genetic programming, neural science and neural net systems, fuzzy set theory and fuzzy systems, and chaos theory and chaotic systems. Soft Computing encourages the integration of soft computing techniques and tools into both everyday and advanced applications. By linking the ideas and techniques of soft computing with other disciplines, the journal serves as a unifying platform that fosters comparisons, extensions, and new applications. As a result, the journal is an international forum for all scientists and engineers engaged in research and development in this fast growing field.
期刊最新文献
Handwritten text recognition and information extraction from ancient manuscripts using deep convolutional and recurrent neural network Optimizing green solid transportation with carbon cap and trade: a multi-objective two-stage approach in a type-2 Pythagorean fuzzy context Production chain modeling based on learning flow stochastic petri nets Multi-population multi-strategy differential evolution algorithm with dynamic population size adjustment Dynamic parameter identification of modular robot manipulators based on hybrid optimization strategy: genetic algorithm and least squares method
×
引用
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