It's about Time: Rethinking Evaluation on Rumor Detection Benchmarks using Chronological Splits

Yida Mu, Kalina Bontcheva, Nikolaos Aletras
2/6/2023
cs.CL

No official code found. Best implementation: YIDAMU/Rumor_Benchmarks_Temporality (3 stars, last commit 2024-01-18).

Abstract

New events emerge over time influencing the topics of rumors in social media. Current rumor detection benchmarks use random splits as training, development and test sets which typically results in topical overlaps. Consequently, models trained on random splits may not perform well on rumor classification on previously unseen topics due to the temporal concept drift. In this paper, we provide a re-evaluation of classification models on four popular rumor detection benchmarks considering chronological instead of random splits. Our experimental results show that the use of random splits can significantly overestimate predictive performance across all datasets and models. Therefore, we suggest that rumor detection models should always be evaluated using chronological splits for minimizing topical overlaps.

View on arXivView PDF

Code Implementations(1)

30Jupyter NotebookJul 4, 20222 years ago

Similar Papers

Cite this paper

@article{mu2023its,
  title  = {It's about Time: Rethinking Evaluation on Rumor Detection Benchmarks using Chronological Splits},
  author = {Yida Mu and Kalina Bontcheva and Nikolaos Aletras},
  year   = {2023},
  eprint = {2302.03147},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.03147v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.03147.svg)](https://codeofpaper.com/paper/2302.03147)

Discussion