Enhancing Fake-News Detection with Node-Level Topological Features
This is an incremental improvement for fake-news detection systems, offering a lightweight and interpretable method to incorporate graph metrics.
The paper tackled fake-news detection by enhancing node embeddings with topological features like degree centrality and local clustering coefficient, boosting macro F1 from 0.7753 to 0.8344 on the UPFD Politifact subset.
In recent years, the proliferation of misinformation and fake news has posed serious threats to individuals and society, spurring intense research into automated detection methods. Previous work showed that integrating content, user preferences, and propagation structure achieves strong performance, but leaves all graph-level representation learning entirely to the GNN, hiding any explicit topological cues. To close this gap, we introduce a lightweight enhancement: for each node, we append two classical graph-theoretic metrics, degree centrality and local clustering coefficient, to its original BERT and profile embeddings, thus explicitly flagging the roles of hub and community. In the UPFD Politifact subset, this simple modification boosts macro F1 from 0.7753 to 0.8344 over the original baseline. Our study not only demonstrates the practical value of explicit topology features in fake-news detection but also provides an interpretable, easily reproducible template for fusing graph metrics in other information-diffusion tasks.