Towards Real-World Rumor Detection: Anomaly Detection Framework with Graph Supervised Contrastive Learning

• URL: http://arxiv.org/abs/2508.07205v1
• Date: Sun, 10 Aug 2025 06:59:33 GMT
• Title: Towards Real-World Rumor Detection: Anomaly Detection Framework with Graph Supervised Contrastive Learning
• Authors: Chaoqun Cui, Caiyan Jia,
• Abstract summary: We construct two large-scale conversation datasets from Weibo and Twitter.<n>We find obvious differences between rumor and non-rumor distributions.<n>We propose the Anomaly Detection framework Graph Supervised Contrastive Learning.
• Score: 3.2803526084968904
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Current rumor detection methods based on propagation structure learning predominately treat rumor detection as a class-balanced classification task on limited labeled data. However, real-world social media data exhibits an imbalanced distribution with a minority of rumors among massive regular posts. To address the data scarcity and imbalance issues, we construct two large-scale conversation datasets from Weibo and Twitter and analyze the domain distributions. We find obvious differences between rumor and non-rumor distributions, with non-rumors mostly in entertainment domains while rumors concentrate in news, indicating the conformity of rumor detection to an anomaly detection paradigm. Correspondingly, we propose the Anomaly Detection framework with Graph Supervised Contrastive Learning (AD-GSCL). It heuristically treats unlabeled data as non-rumors and adapts graph contrastive learning for rumor detection. Extensive experiments demonstrate AD-GSCL's superiority under class-balanced, imbalanced, and few-shot conditions. Our findings provide valuable insights for real-world rumor detection featuring imbalanced data distributions.

Related papers

• Graph Representation Learning with Massive Unlabeled Data for Rumor Detection [3.2803526084968904]
  We use large-scale unlabeled topic datasets crawled from the social media platform Weibo and Twitter with claim propagation structure to improve the semantic learning ability of a graph reprentation learing model on various topics.<n>Our experiments show that these general graph self-supervised learning methods outperform previous methods specifically designed for rumor detection tasks.
  arXiv  Detail & Related papers  (2025-08-06T09:33:56Z)
• Continuous Contrastive Learning for Long-Tailed Semi-Supervised Recognition [50.61991746981703]
  Current state-of-the-art LTSSL approaches rely on high-quality pseudo-labels for large-scale unlabeled data. This paper introduces a novel probabilistic framework that unifies various recent proposals in long-tail learning. We introduce a continuous contrastive learning method, CCL, extending our framework to unlabeled data using reliable and smoothed pseudo-labels.
  arXiv  Detail & Related papers  (2024-10-08T15:06:10Z)
• An accurate detection is not all you need to combat label noise in web-noisy datasets [23.020126612431746]
  We show that direct estimation of the separating hyperplane can indeed offer an accurate detection of OOD samples. We propose a hybrid solution that alternates between noise detection using linear separation and a state-of-the-art (SOTA) small-loss approach.
  arXiv  Detail & Related papers  (2024-07-08T00:21:42Z)
• Rumor Detection with a novel graph neural network approach [12.42658463552019]
  We propose a new detection model, that jointly learns the representations of user correlation and information propagation to detect rumors on social media. Specifically, we leverage graph neural networks to learn the representations of user correlation from a bipartite graph. We show that it requires a high cost for attackers to subvert user correlation pattern, demonstrating the importance of considering user correlation for rumor detection.
  arXiv  Detail & Related papers  (2024-03-24T15:59:47Z)
• Graph Out-of-Distribution Generalization with Controllable Data Augmentation [51.17476258673232]
  Graph Neural Network (GNN) has demonstrated extraordinary performance in classifying graph properties. Due to the selection bias of training and testing data, distribution deviation is widespread. We propose OOD calibration to measure the distribution deviation of virtual samples.
  arXiv  Detail & Related papers  (2023-08-16T13:10:27Z)
• A Unified Contrastive Transfer Framework with Propagation Structure for Boosting Low-Resource Rumor Detection [11.201348902221257]
  existing rumor detection algorithms show promising performance on yesterday's news. Due to a lack of substantial training data and prior expert knowledge, they are poor at spotting rumors concerning unforeseen events. We propose a unified contrastive transfer framework to detect rumors by adapting the features learned from well-resourced rumor data to that of the low-resourced with only few-shot annotations.
  arXiv  Detail & Related papers  (2023-04-04T03:13:03Z)
• Probing Spurious Correlations in Popular Event-Based Rumor Detection Benchmarks [28.550143417847373]
  Open-source benchmark datasets suffer from spurious correlations, which are ignored by existing studies. We propose event-separated rumor detection as a solution to eliminate spurious cues. Our method outperforms existing baselines in terms of effectiveness, efficiency and generalizability.
  arXiv  Detail & Related papers  (2022-09-19T07:11:36Z)
• Rumor Detection with Self-supervised Learning on Texts and Social Graph [101.94546286960642]
  We propose contrastive self-supervised learning on heterogeneous information sources, so as to reveal their relations and characterize rumors better. We term this framework as Self-supervised Rumor Detection (SRD) Extensive experiments on three real-world datasets validate the effectiveness of SRD for automatic rumor detection on social media.
  arXiv  Detail & Related papers  (2022-04-19T12:10:03Z)
• SLA$^2$P: Self-supervised Anomaly Detection with Adversarial Perturbation [77.71161225100927]
  Anomaly detection is a fundamental yet challenging problem in machine learning. We propose a novel and powerful framework, dubbed as SLA$2$P, for unsupervised anomaly detection.
  arXiv  Detail & Related papers  (2021-11-25T03:53:43Z)
• Learning with Out-of-Distribution Data for Audio Classification [60.48251022280506]
  We show that detecting and relabelling certain OOD instances, rather than discarding them, can have a positive effect on learning. The proposed method is shown to improve the performance of convolutional neural networks by a significant margin.
  arXiv  Detail & Related papers  (2020-02-11T21:08:06Z)
• Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks [89.13567439679709]
  We propose a novel bi-directional graph model, named Bi-Directional Graph Convolutional Networks (Bi-GCN), to explore both characteristics by operating on both top-down and bottom-up propagation of rumors. It leverages a GCN with a top-down directed graph of rumor spreading to learn the patterns of rumor propagation, and a GCN with an opposite directed graph of rumor diffusion to capture the structures of rumor dispersion.
  arXiv  Detail & Related papers  (2020-01-17T15:12:08Z)

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.