AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.7 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Multiple rumor source localization in signed social networks driven by data intelligence

Ying Guo1Yong-nan Li1,2( )
School of National Security, People's Public Security University of China, Beijing 100038, China
Intelligent Policing and National Security Risk Management Laboratory, Luzhou 646000, China
Show Author Information

Abstract

With the help of deepfake algorithms and social bots, the problems of consciousness penetration and cognitive manipulation caused by the outbreak of internet rumors have become prominent. Accurately locating the rumor sources and quickly cutting off the critical paths of rumor propagation will become an effective ways to curb the explosive spread of rumors and the sudden accumulation of negative emotions. In this paper, we combine the complementary advantages of signed graph convolutional networks in spatial and spectral domains, propose an improved multirumor source localization framework for signed social networks, and extend the rumor centrality principle and source prominence theory to the scope of signed networks. First, structural balance theory is used to accurately model positive and negative social relations. Second, a signed graph convolutional network based on signed attention mechanism is proposed to extract the rumor centrality feature from the infection subgraph. Then, a two-stream graph convolutional network based on a label propagation mechanism is proposed to extract the source prominence feature from the subgraph containing only positive edges and the subgraph containing only negative edges, respectively. Finally, the center feature of the infected structure and the position distribution feature of infected and uninfected nodes are integrated in a unified framework for multirumor source localization. Extensive experimental results on four real-world social network datasets show that compared with state-of-the-art algorithms, our proposed algorithm further improves the accuracy and robustness in the task of multiple rumor source localization.

CLC number: 68T20, 68T37, 91D30, 91E10

References

【1】
【1】
 
 
AIMS Mathematics
Pages 1927-1953

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Guo Y, Li Y-n. Multiple rumor source localization in signed social networks driven by data intelligence. AIMS Mathematics, 2026, 11(1): 1927-1953. https://doi.org/10.3934/math.2026080

328

Views

4

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 11 October 2025
Revised: 05 January 2026
Accepted: 12 January 2026
Published: 21 January 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)