Contrastive Fidelity-Maximised Explanations for Graph-Based Rumour Detection
IEEE Transactions on Knowledge and Data Engineering · 2026-05 · 38 (5) · 2614-2623
DOI: 10.1109/tkde.2026.3673065 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2026-05. Verfasst von Daniel Wai Kit Chin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 67 Literaturangaben.
Abstract (Originalsprache)
Social media platforms have democratised information creation and dissemination by empowering users worldwide to reach vast audiences almost instantaneously. However, these platforms have also become vectors for spreading misinformation such as rumours. If left unchecked, rumours have the potential to cause great economic and political damage and even worsen public health crises. Automated rumour detection systems are imperative to deal with the volume and velocity of information being exchanged on these platforms. Graph Neural Network (GNN)-based approaches have recently emerged as state-of-the-art (SOTA) in automated rumour detection. Despite their performance, these models remain largely opaque, making explaining their predictions challenging, particularly when dealing with noisy social media data. Existing graph explainability techniques struggle to produce high-fidelity contrastive explanations when presented with such noisy data especially when dealing with a multiclass classification problem. To address the issue of noise susceptibility, we propose a novel framework to maximise both contrastivity and fidelity by reframing the explanation task as a maximum margin optimisation problem. Specifically, we impose constraints on explanation set membership and on the influence difference of the prediction explanation set to each other class explanation set. Extensive experiments on real-world datasets show that the proposed method outperforms SOTA methods.
Zitieren
APA
Chin, D. W. K., & Lee, R. K. (2026). Contrastive Fidelity-Maximised Explanations for Graph-Based Rumour Detection. IEEE Transactions on Knowledge and Data Engineering, 38(5), 2614-2623. https://doi.org/10.1109/tkde.2026.3673065
Vancouver
Chin DWK, Lee RK. Contrastive Fidelity-Maximised Explanations for Graph-Based Rumour Detection. IEEE Transactions on Knowledge and Data Engineering. 2026;38(5):2614-2623. doi:10.1109/tkde.2026.3673065
BibTeX
@article{Chin2026,
author = {Chin, Daniel Wai Kit and Lee, Roy Ka-Wei},
title = {Contrastive Fidelity-Maximised Explanations for Graph-Based Rumour Detection},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2026},
volume = {38},
number = {5},
pages = {2614--2623},
doi = {10.1109/tkde.2026.3673065}
}
EUVIMED