Towards Robust and Explainable Early Rumor Detection: A Noise- Aware Graph Learning Framework
DOI:
https://doi.org/10.32350.umt-air.52.01Keywords:
rumor detection, graph neural networks, uncertainty, early detection, robustness, explainabilityAbstract
Social media platforms have changed the communication process in such a radical way that now it takes just a few moments for unverified or fake news to reach millions of users. While in the past couple of years various methods have been developed to fight against the spread of false rumors, there are still many challenges to face. These
challenges include dealing with noisy data, fast detection, and offering actionable insights for giving quick solutions. The current study aimed to put forward a conceptual noise-aware graph-based framework for the early detection of false rumors on social media. The framework melds together robustness, propagation-aware graph representations, and lightweight early-warning mechanisms in a single design. In order to depict the propagation patterns, the framework makes use of Graph Neural Networks (GNNs) for graph-based propagation modeling and also supports an uncertainty estimation module to handle data biases and incompleteness. One of the main features of the framework is the pinpointing of the most influential posts, users, and propagation paths that have a direct effect on the detection outcomes. While this work is not centered around experimental results, it lays out in detail the real-world validation plan using benchmark datasets, such as Twitter15/16, Weibo, and FakeNewsNet. The integration of noise-awareness, early detection, and interpretability in a single framework is the first step in the direction of robust and explainable rumor detection, thus opening new avenues for future theoretical and experimental work in this field.
Downloads
References
[1] A. R. Pathak, A. Mahajan, K. Singh,
A. Patil, and A. Nair, “Analysis of
techniques for rumor detection in
social media,” Procedia Comput. Sci.,
vol. 167, pp. 2286–2296, Mar. 2020,
j.procs.2020.03.281.
[2] A. Zubiaga, A. Aker, K. Bontcheva,
M. Liakata, and R. Procter, “Detection
and resolution of rumours in social
media: A survey,” ACM Comput.
Surv., vol. 51, no. 2, June 2018, doi:
https://doi.org/10.1145/3161603.
[3] F. Yang, X. Yu, Y. Liu, and M. Yang,
“Automatic detection of rumor on
Sina Weibo,” in Proc. ACM SIGKDD
Int. Conf. Knowl. Discov. Data Min.,
Aug. 2012, pp. 1243–1251, doi:
https://
doi.org/10.1145/2350190.2350203.
[4] S. Song, Y. Huang, and H. Lu,
“Rumor detection on social media
with bi-directional graph
convolutional networks,” in Proc.
IEEE Int. Conf. Syst., Man, Cybern.
(SMC), Oct. 2021, pp. 2395–2400,
doi: https://doi.org
/10.1109/SMC52423.2021.9659106.
[5] F. Monti, F. Frasca, D. Eynard, D.
Mannion, and M. M. Bronstein, “Fake
news detection on social media using
geometric deep learning,” arXiv
preprint arXiv:1902.06673, Feb.
2019, doi:
http://arxiv.org/abs/1902.06673.
[6] H. T. Phan, N. T. Nguyen, and D.
Hwang, “Fake news detection: A
survey of graph neural network
methods,” Appl. Soft Comput., vol.
Towards Robust and Explainable Early…
22 UMT Artificial Intelligence Review
Volume 5 Issue 2, Fall 2025
139, Art. no. 110235, June 2023, doi:
https://doi.org/10.1016/j.asoc.2023.11
0235.
[7] W. Xu, J. Wu, Q. Liu, S. Wu, and L.
Wang, “Evidence-aware fake news
detection with graph neural
networks,” in Proc. ACM Web Conf.,
Apr. 2022, pp. 2501–2510, doi:
/10.1145/3485447.3512122.
[8] J. Zhu, C. Gao, Z. Yin, X. Li, and J.
Kurths, “Propagation structure-aware
graph transformer for robust and
interpretable fake news detection,” in
Proc. ACM SIGKDD Int. Conf.
Knowl. Discov. Data Min., Aug. 2024,
pp. 4652–4663, doi: https://doi.org
/10.1145/3637528.3672024.
[9] J. Xu, J. Chen, S. You, Z. Xiao, Y.
Yang, and J. Lu, “Robustness of deep
learning models on graphs: A survey,”
AI Open, vol. 2, pp. 69–78, June 2021,
doi: https://doi.org/10.1016/j.aiopen.
2021.05.002.
[10] Y. Liu and Y. F. Wu, “Early detection
of fake news on social media through
propagation path classification,” in
Proc. AAAI Conf. Artif. Intell., Feb.
2018, pp. 354–361.
[11] K. Shu, D. Mahudeswaran, S. Wang,
and H. Liu, “Hierarchical propagation
networks for fake news detection:
Investigation and exploitation,” in
Proc. Int. AAAI Conf. Web Soc.
Media, June 2020, pp. 626–637, doi:
https://
doi.org/10.1609/icwsm.v14i1.7329.
[12] M. A. Alonso, D. Vilares, C. Gómez-
Rodríguez, and J. Vilares, “Sentiment
analysis for fake news detection,”
Electronics, vol. 10, no. 11, p. 1348,
June 2021, doi: https://doi.org
/10.3390/electronics10111348.
[13] H. Zhang, Q. Fang, S. Qian, and C.
Xu, “Multi-modal knowledge-aware
event memory network for social
media rumor detection,” in Proc.
ACM Int. Conf. Multimedia (MM),
Oct. 2019, pp. 1942–1951, doi:
10.1145/3343031.3350850.
[14] P. Wang, H. Shi, X. Wu, and L. Jiao,
“Sentiment analysis of rumor spread
amid COVID-19: Based on Weibo
text,” Healthcare, vol. 9, no. 10, p.
1275, Oct. 2021, doi: https://
doi.org/10.3390/healthcare9101275.
[15] H. Khazane, M. Ridouani, F.
Salahdine, and N. Kaabouch, “A
holistic review of machine learning
adversarial attacks in IoT networks,”
Future Internet, vol. 16, no. 1, Art.
no. 32, Jan. 2024, doi:
https://doi.org/10.3390/fi16010032.
[16] L. Hu et al., “Dual-aspect active
learning with domain-adversarial
training for low-resource
misinformation detection,”
Mathematics, vol. 13, no. 11, Art. no.
1752, June 2025, doi:
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 ABU BAKAR SHABBIR, Usama Husnain
This work is licensed under a Creative Commons Attribution 4.0 International License.
UMT-AIR follow an open-access publishing policy and full text of all published articles is available free, immediately upon publication of an issue. The journal’s contents are published and distributed under the terms of the Creative Commons Attribution 4.0 International (CC-BY 4.0) license. Thus, the work submitted to the journal implies that it is original, unpublished work of the authors (neither published previously nor accepted/under consideration for publication elsewhere). On acceptance of a manuscript for publication, a corresponding author on the behalf of all co-authors of the manuscript will sign and submit a completed the Copyright and Author Consent Form.
