Proactive Rumor Control Using Graph Neural Networks and Evolutionary Optimization

Abstract In the digital age, social networks have become critical platforms for information dissemination, but they also pose significant risks due to the rapid spread of rumors and misinformation. Existing approaches to rumor control often rely on models that assume a single exposure to anti-rumor information is sufficient to mitigate its impact, overlooking the necessity of multiple impressions for effective behavior change. In this work, we address the Rumor Control with Impression Counts problem by proposing the first-ever Machine Learning (ML)-based solution. Our approach leverages Graph Neural Networks combined with a greedy algorithm to efficiently manage large-scale social networks. To further enhance computational efficiency, we incorporate Evolutionary Optimization, resulting in a method that not only addresses the effectiveness challenges but also scales efficiently with network size. Extensive experiments on real-world datasets demonstrate that our approach outperforms existing methods in both effectiveness and scalability, improving computational efficiency by 1 to 2 orders of magnitude.

Authors

Institutions

Publication Details

Journal
Data Science and Engineering
Published
2025-08-22
DOI
https://doi.org/10.1007/s41019-025-00304-y
Citations
2
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
2.65

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Proactive Rumor Control Using Graph Neural Networks and Evolutionary Optimization

Zhiyong Peng, Pengfei Xu, Liwei Wang
2 citations
Data Science and Engineering
Complex Network Analysis Techniques
2.65
article

Proactive Rumor Control Using Graph Neural Networks and Evolutionary Optimization

Zhiyong Peng, Pengfei Xu, Liwei Wang
article en
2 citations

Abstract

Abstract In the digital age, social networks have become critical platforms for information dissemination, but they also pose significant risks due to the rapid spread of rumors and misinformation. Existing approaches to rumor control often rely on models that assume a single exposure to anti-rumor information is sufficient to mitigate its impact, overlooking the necessity of multiple impressions for effective behavior change. In this work, we address the Rumor Control with Impression Counts problem by proposing the first-ever Machine Learning (ML)-based solution. Our approach leverages Graph Neural Networks combined with a greedy algorithm to efficiently manage large-scale social networks. To further enhance computational efficiency, we incorporate Evolutionary Optimization, resulting in a method that not only addresses the effectiveness challenges but also scales efficiently with network size. Extensive experiments on real-world datasets demonstrate that our approach outperforms existing methods in both effectiveness and scalability, improving computational efficiency by 1 to 2 orders of magnitude.

Data Science and EngineeringVol. 10(4)
Wuhan University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 9%
Complex Network Analysis Techniques
2.65
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.