利用社区结构的osn中的错误信息遏制

A. Ghoshal, Nabanita Das, Soham Das
{"title":"利用社区结构的osn中的错误信息遏制","authors":"A. Ghoshal, Nabanita Das, Soham Das","doi":"10.1109/ICAwST.2019.8923277","DOIUrl":null,"url":null,"abstract":"With the emergence of Online Social Networks (OSNs) as a major platform of communication, its abuse to spread misinformation has become a major threat to our society. In this paper, we study the misinformation containment problem in OSN. Given a snapshot of the OSN with a set of misinformed nodes, and a budget in terms of maximum number of seed nodes, the problem is to select the seed nodes, referred here as the beacon nodes, to plant the correct information, to minimize and eventually eradicate the misinformation at the earliest. We leverage the community structure of the OSN to select the beacon nodes, prioritizing the Community Boundary Nodes. To the best of our knowledge, this is the first work to exploit the topology of the OSN to combat misinformation spread. A modified form of Independent Cascade Model is followed to study the adversarial propagation of both misinformation and the correct information. Simulation on real data set shows that the proposed algorithm outperforms earlier algorithm [1] significantly in terms of maximum (average) infected time and the point of decline.","PeriodicalId":156538,"journal":{"name":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Misinformation Containment in OSNs leveraging Community Structure\",\"authors\":\"A. Ghoshal, Nabanita Das, Soham Das\",\"doi\":\"10.1109/ICAwST.2019.8923277\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the emergence of Online Social Networks (OSNs) as a major platform of communication, its abuse to spread misinformation has become a major threat to our society. In this paper, we study the misinformation containment problem in OSN. Given a snapshot of the OSN with a set of misinformed nodes, and a budget in terms of maximum number of seed nodes, the problem is to select the seed nodes, referred here as the beacon nodes, to plant the correct information, to minimize and eventually eradicate the misinformation at the earliest. We leverage the community structure of the OSN to select the beacon nodes, prioritizing the Community Boundary Nodes. To the best of our knowledge, this is the first work to exploit the topology of the OSN to combat misinformation spread. A modified form of Independent Cascade Model is followed to study the adversarial propagation of both misinformation and the correct information. Simulation on real data set shows that the proposed algorithm outperforms earlier algorithm [1] significantly in terms of maximum (average) infected time and the point of decline.\",\"PeriodicalId\":156538,\"journal\":{\"name\":\"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAwST.2019.8923277\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAwST.2019.8923277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

随着在线社交网络(Online Social Networks, OSNs)作为主要的交流平台的出现,滥用它传播错误信息已经成为对我们社会的重大威胁。本文研究了OSN系统中的错误信息遏制问题。给定一个带有一组错误信息节点的OSN快照,以及一个最大种子节点数量的预算,问题是选择种子节点(这里称为信标节点)来种植正确的信息,以尽早减少并最终消除错误信息。我们利用OSN的社区结构选择信标节点,优先选择社区边界节点。据我们所知,这是第一次利用OSN的拓扑结构来对抗错误信息的传播。采用一种改进的独立级联模型来研究错误信息和正确信息的对抗性传播。在真实数据集上的仿真表明,本文算法在最大(平均)感染时间和下降点上都明显优于先前的算法[1]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Misinformation Containment in OSNs leveraging Community Structure
With the emergence of Online Social Networks (OSNs) as a major platform of communication, its abuse to spread misinformation has become a major threat to our society. In this paper, we study the misinformation containment problem in OSN. Given a snapshot of the OSN with a set of misinformed nodes, and a budget in terms of maximum number of seed nodes, the problem is to select the seed nodes, referred here as the beacon nodes, to plant the correct information, to minimize and eventually eradicate the misinformation at the earliest. We leverage the community structure of the OSN to select the beacon nodes, prioritizing the Community Boundary Nodes. To the best of our knowledge, this is the first work to exploit the topology of the OSN to combat misinformation spread. A modified form of Independent Cascade Model is followed to study the adversarial propagation of both misinformation and the correct information. Simulation on real data set shows that the proposed algorithm outperforms earlier algorithm [1] significantly in terms of maximum (average) infected time and the point of decline.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信