Graph Neural Networks for Misinformation Detection: Performance-Efficiency Trade-offs

• URL: http://arxiv.org/abs/2604.08131v1
• Date: Thu, 09 Apr 2026 11:48:00 GMT
• Title: Graph Neural Networks for Misinformation Detection: Performance-Efficiency Trade-offs
• Abstract summary: We benchmark graph neural networks (GNNs) against non-graph-based machine learning methods.<n>All models use identical TF-IDF features to isolate the impact of relational structure.<n>GNNs consistently outperform non-graph baselines across all datasets.
• Score: 9.754051234251827
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The rapid spread of online misinformation has led to increasingly complex detection models, including large language models and hybrid architectures. However, their computational cost and deployment limitations raise concerns about practical applicability. In this work, we benchmark graph neural networks (GNNs) against non-graph-based machine learning methods under controlled and comparable conditions. We evaluate lightweight GNN architectures (GCN, GraphSAGE, GAT, ChebNet) against Logistic Regression, Support Vector Machines, and Multilayer Perceptrons across seven public datasets in English, Indonesian, and Polish. All models use identical TF-IDF features to isolate the impact of relational structure. Performance is measured using F1 score, with inference time reported to assess efficiency. GNNs consistently outperform non-graph baselines across all datasets. For example, GraphSAGE achieves 96.8% F1 on Kaggle and 91.9% on WELFake, compared to 73.2% and 66.8% for MLP, respectively. On COVID-19, GraphSAGE reaches 90.5% F1 vs. 74.9%, while ChebNet attains 79.1% vs. 66.4% on FakeNewsNet. These gains are achieved with comparable or lower inference times. Overall, the results show that classic GNNs remain effective and efficient, challenging the need for increasingly complex architectures in misinformation detection.

Related papers

• Robustness of Spatio-temporal Graph Neural Networks for Fault Location in Partially Observable Distribution Grids [2.183622338864934]
  Fault location in distribution grids is critical for reliability and minimizing outage durations.<n>Recent works show promising results by combining Recurrent Neural Networks (RNNs) and Graph Neural Networks (GNNs) for sparse-temporal learning.<n>We show that measured-only graphs offer a more practical, efficient, and robust framework for partially observable distribution grids.
  arXiv  Detail & Related papers  (2026-04-22T10:13:28Z)
• LPS-GNN : Deploying Graph Neural Networks on Graphs with 100-Billion Edges [22.66363194587289]
  This paper introduces a scalable, low-cost, flexible, and efficient GNN framework called LPS-GNN.<n>It can perform representation learning on 100 billion graphs with a single GPU in 10 hours and shows a 13.8% improvement in User Acquisition scenarios.<n> LPS-GNN has been tested on public and real-world datasets, achieving performance lifts of 8. 24% to 13.89% over SOTA models in online applications.
  arXiv  Detail & Related papers  (2025-07-19T10:44:26Z)
• Is Graph Convolution Always Beneficial For Every Feature? [14.15740180531667]
  Topological Feature Informativeness (TFI) is a novel metric to distinguish between GNN-favored and GNN-disfavored features. We propose a simple yet effective Graph Feature Selection (GFS) method, which processes GNN-favored and GNN-disfavored features separately.
  arXiv  Detail & Related papers  (2024-11-12T09:28:55Z)
• A Comparative Analysis of CNN-based Deep Learning Models for Landslide Detection [0.0]
  Landslides in northern parts of India and Nepal have caused significant disruption, damaging infrastructure and posing threats to local communities. Recent landslides in northern parts of India and Nepal have caused significant disruption, damaging infrastructure and posing threats to local communities. CNNs, a type of deep learning technique, have shown remarkable success in image processing.
  arXiv  Detail & Related papers  (2024-08-03T07:20:10Z)
• GCF: Graph Convolutional Networks for Facial Expression Recognition [0.0]
  We propose Graph Convolutional Networks (CNNs) for Facial Expression Recognition (FER) GCF integrates CNNs for feature extraction, using either custom architectures or pretrained models. We evaluate GCF on benchmark datasets including CK+, JAFFE, and FERG.
  arXiv  Detail & Related papers  (2024-07-02T15:27:33Z)
• Chasing Fairness in Graphs: A GNN Architecture Perspective [73.43111851492593]
  We propose textsfFair textsfMessage textsfPassing (FMP) designed within a unified optimization framework for graph neural networks (GNNs) In FMP, the aggregation is first adopted to utilize neighbors' information and then the bias mitigation step explicitly pushes demographic group node presentation centers together. Experiments on node classification tasks demonstrate that the proposed FMP outperforms several baselines in terms of fairness and accuracy on three real-world datasets.
  arXiv  Detail & Related papers  (2023-12-19T18:00:15Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Learning Strong Graph Neural Networks with Weak Information [64.64996100343602]
  We develop a principled approach to the problem of graph learning with weak information (GLWI) We propose D$2$PT, a dual-channel GNN framework that performs long-range information propagation on the input graph with incomplete structure, but also on a global graph that encodes global semantic similarities.
  arXiv  Detail & Related papers  (2023-05-29T04:51:09Z)
• Graph Neural Network for Accurate and Low-complexity SAR ATR [2.9766397696234996]
  We propose a graph neural network (GNN) model to achieve accurate and low-latency SAR ATR. The proposed GNN model has low computation complexity and achieves comparable high accuracy. Compared with the state-of-the-art CNNs, the proposed GNN model has only 1/3000 computation cost and 1/80 model size.
  arXiv  Detail & Related papers  (2023-05-11T20:17:41Z)
• EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks [51.42338058718487]
  Graph Neural Networks (GNNs) have received extensive research attention for their promising performance in graph machine learning. Existing approaches, such as GCN and GPRGNN, are not robust in the face of homophily changes on test graphs. We propose EvenNet, a spectral GNN corresponding to an even-polynomial graph filter.
  arXiv  Detail & Related papers  (2022-05-27T10:48:14Z)
• A Unified Lottery Ticket Hypothesis for Graph Neural Networks [82.31087406264437]
  We present a unified GNN sparsification (UGS) framework that simultaneously prunes the graph adjacency matrix and the model weights. We further generalize the popular lottery ticket hypothesis to GNNs for the first time, by defining a graph lottery ticket (GLT) as a pair of core sub-dataset and sparse sub-network.
  arXiv  Detail & Related papers  (2021-02-12T21:52:43Z)
• Combining Label Propagation and Simple Models Out-performs Graph Neural Networks [52.121819834353865]
  We show that for many standard transductive node classification benchmarks, we can exceed or match the performance of state-of-the-art GNNs. We call this overall procedure Correct and Smooth (C&S) Our approach exceeds or nearly matches the performance of state-of-the-art GNNs on a wide variety of benchmarks.
  arXiv  Detail & Related papers  (2020-10-27T02:10:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.