English
 
Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Noise-Filtering Enhanced Graph Transformer for Robust Fake News Detection

Authors
/persons/resource/Junyou.Zhu

Zhu,  Junyou
Potsdam Institute for Climate Impact Research;

Gao,  Chao
External Organizations;

Yin,  Ze
External Organizations;

Li,  Xianghua
External Organizations;

Wang,  Zhen
External Organizations;

/persons/resource/Juergen.Kurths

Kurths,  Jürgen
Potsdam Institute for Climate Impact Research;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Zhu, J., Gao, C., Yin, Z., Li, X., Wang, Z., Kurths, J. (2026): Noise-Filtering Enhanced Graph Transformer for Robust Fake News Detection. - IEEE Transactions on Knowledge and Data Engineering, 38, 6, 3778-3791.
https://doi.org/10.1109/TKDE.2026.3677544


Cite as: https://publications.pik-potsdam.de/pubman/item/item_35208
Abstract
The rapid spread of fake news on social media has significantly increased the importance of computational detection methods. Graph-based approaches, particularly Graph Neural Networks (GNNs), have emerged as powerful tools for modeling news propagation patterns. Despite their potential, current GNN-based methods still face challenges in robustness and interpretability due to two key shortcomings: they inadequately filter out irrelevant user-induced noise within propagation graphs, and their shallow architectures fail to effectively capture the intricate long-range dependencies characteristic of news propagation. To overcome these limitations, we propose NEGT (Noise-filtering Enhanced Graph Transformer), a novel graph Transformer framework explicitly designed for fake news detection. NEGT introduces a noise-augmented information bottleneck strategy embedded within its self-attention mechanism, effectively identifying and removing task-irrelevant interactions. Additionally, we propose a novel relational propagation graph encoding a strategy that explicitly captures multi-scale user relationships and propagation depth, enabling NEGT to model long-sequence propagation dependencies accurately. Experiments on various benchmark datasets show that NEGT surpasses current methods in accuracy, noise robustness, and interpretability.