Loading…

Timeliness-aware rumor sources identification in community-structured dynamic online social networks

Identifying rumor sources in online social networks (OSNs) plays a crucial role in controlling the spread of rumors and mitigating their damage. However, the community structure of OSNs and timeliness of rumors increase the complexity of accurately characterizing rumor-spreading behavior, making it...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 2025-01, Vol.689, p.121508, Article 121508
Main Authors: Huang, Da-Wen, Wu, Wenjie, Bi, Jichao, Li, Junli, Gan, Chenquan, Zhou, Wei
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Identifying rumor sources in online social networks (OSNs) plays a crucial role in controlling the spread of rumors and mitigating their damage. However, the community structure of OSNs and timeliness of rumors increase the complexity of accurately characterizing rumor-spreading behavior, making it extremely challenging to identify the source of rumor in OSNs. Conventional studies on rumor source identification often overlook the community structure of OSNs and timeliness of rumors. This paper proposes a rumor sources identification framework that take these two aspects into consideration. First, we transfer the snapshots of a dynamic OSN into a community-structured dynamic OSN through 4 meticulously designed phases. Second, instead of considering a constant influence of rumors in traditional techniques, we introduce a time-varying dynamic propagation parameter to quantify the timeliness of rumor, and apply the propagation parameter to establish a microscopic rumor spreading model. This process addresses the issue of modeling the timeliness of rumor. Third, we adopt sensor-based observation techniques to collect the propagation information of rumor, and a hybrid sensor deployment strategy is designed to improve the efficiency of information collection. Fourth, we propose an algorithm for identifying single and multiple rumor sources in community-structured dynamic OSN, this algorithm initiates with the utilization of some criteria to analyze the gathered propagation information and estimate the suspicious communities that harbor the source of rumors. Subsequently, it applies maximum likelihood estimation method within each community to determine the ultimate source of the rumor. Experimental results on real-world and synthetic networks indicate that our method can accurately identify the real rumor sources. To the best of our knowledge, the proposed method is the first that can be used to identify rumor sources in community-structured dynamic OSNs.
ISSN:0020-0255
DOI:10.1016/j.ins.2024.121508