Online Social Networks (OSNs) are increasingly exploited for campaigns involving the spread of multiple rumors to influence opinions about products or individuals, making rumor mitigation a critical challenge. Unlike existing works that primarily address single rumor scenarios, this research tackles the complexities of multi-rumor influence, where prior exposure can bias users and impact communities unevenly. To address this, we propose a novel Bayesian Inference based Community Influence model that accounts for the community structure of OSNs in assessing the impact of multiple rumors. Furthermore, we introduce a Two-phase Community based Genetic (TCG) algorithm designed to strategically select seed users for counter-rumor dissemination, aiming to effectively mitigate the spread of influence in this multi-rumor context under a given budget. The effectiveness of our proposed approach is evaluated through extensive experimentation on two datasets by considering the budget k.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Multi-rumor Mitigation Through Counter-Rumors Using Genetic Algorithm and Community Structure in Online Social Networks

  • Parimi Priyanka,
  • Rout Rashmi Ranjan

摘要

Online Social Networks (OSNs) are increasingly exploited for campaigns involving the spread of multiple rumors to influence opinions about products or individuals, making rumor mitigation a critical challenge. Unlike existing works that primarily address single rumor scenarios, this research tackles the complexities of multi-rumor influence, where prior exposure can bias users and impact communities unevenly. To address this, we propose a novel Bayesian Inference based Community Influence model that accounts for the community structure of OSNs in assessing the impact of multiple rumors. Furthermore, we introduce a Two-phase Community based Genetic (TCG) algorithm designed to strategically select seed users for counter-rumor dissemination, aiming to effectively mitigate the spread of influence in this multi-rumor context under a given budget. The effectiveness of our proposed approach is evaluated through extensive experimentation on two datasets by considering the budget k.