mlsanityData to 7 Oct 2026

LOSS-GAT: Label Propagation and One-Class Semi-Supervised Graph Attention Network for Fake News Detection

arXiv 2402.08401 ↗First posted 13 Feb 2024cs.LG cs.AI cs.SIcited by 2

Not on the map. Why?

Abstract (arXiv)

In the era of widespread social networks, the rapid dissemination of fake news has emerged as a significant threat, inflicting detrimental consequences across various dimensions of people's lives. Machine learning and deep learning approaches have been extensively employed for identifying fake news. However, a significant challenge in identifying fake news is the limited availability of labeled news datasets. Therefore, the One-Class Learning (OCL) approach, utilizing only a small set of labeled data from the interest class, can be a suitable approach to address this challenge. On the other hand, representing data as a graph enables access to diverse content and structural information, and label propagation methods on graphs can be effective in predicting node labels. In this paper, we adopt a graph-based model for data representation and introduce a semi-supervised and one-class approach for fake news detection, called LOSS-GAT. Initially, we employ a two-step label propagation algorithm, utilizing Graph Neural Networks (GNNs) as an initial classifier to categorize news into two groups: interest (fake) and non-interest (real). Subsequently, we enhance the graph structure using structural augmentation techniques. Ultimately, we predict the final labels for all unlabeled data using a GNN that induces randomness within the local neighborhood of nodes through the aggregation function. We evaluate our proposed method on five common datasets and compare the results against a set of baseline models, including both OCL and binary labeled models. The results demonstrate that LOSS-GAT achieves a notable improvement, surpassing 10%, with the advantage of utilizing only a limited set of labeled fake news. Noteworthy, LOSS-GAT even outperforms binary labeled models.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 70 references that are in the map. First posted on arXiv 13 Feb 2024.

Builds on

18 of 70 references.

References · 18

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  4. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  5. 2021How Attentive are Graph Attention Networks?cited by 818
  6. 2014Distributed Representations of Sentences and Documentscited by 677
  7. 2017Fake News Detection on Social Media: A Data Mining Perspectivecited by 334
  8. 2018FakeNewsNet: A Data Repository with News Content, Social Context and Spatialtemporal Information for Studying Fake News on Social Mediacited by 281
  9. 2017Detection and Resolution of Rumours in Social Media: A Surveycited by 103
  10. 2019Skeleton-Based Action Recognition with Multi-Stream Adaptive Graph Convolutional Networkscited by 103
  11. 2020k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)cited by 56
  12. 2023Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignmentcited by 25
6 more
  1. 2021Adversarial Active Learning based Heterogeneous Graph Neural Network for Fake News Detectioncited by 21
  2. 2020Combating Disinformation in a Social Media Agecited by 17
  3. 2021Cross-SEAN: A Cross-Stitch Semi-Supervised Neural Attention Model for COVID-19 Fake News Detectioncited by 15
  4. 2023GAMC: An Unsupervised Method for Fake News Detection using Graph Autoencoder with Maskingcited by 14
  5. 2020Two-path Deep Semi-supervised Learning for Timely Fake News Detectioncited by 9
  6. 2021A Unified Graph-Based Approach to Disinformation Detection using Contextual and Semantic Relationscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.