mlsanityData to 7 Oct 2026

Combating Hostility: Covid-19 Fake News and Hostile Post Detection in Social Media

arXiv 2101.03291 ↗First posted 9 Jan 2021cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

This paper illustrates a detail description of the system and its results that developed as a part of the participation at CONSTRAINT shared task in AAAI-2021. The shared task comprises two tasks: a) COVID19 fake news detection in English b) Hostile post detection in Hindi. Task-A is a binary classification problem with fake and real class, while task-B is a multi-label multi-class classification task with five hostile classes (i.e. defame, fake, hate, offense, non-hostile). Various techniques are used to perform the classification task, including SVM, CNN, BiLSTM, and CNN+BiLSTM with tf-idf and Word2Vec embedding techniques. Results indicate that SVM with tf-idf features achieved the highest 94.39% weighted f1 score on the test set in task-A. Label powerset SVM with n-gram features obtained the maximum coarse-grained and fine-grained f1 score of 86.03% and 50.98% on the task-B test set respectively.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 7 of its 19 references that are in the map. First posted on arXiv 9 Jan 2021.

Builds on

7 of 19 references.

References · 7

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  3. 2017"Liar, Liar Pants on Fire": A New Benchmark Dataset for Fake News Detectioncited by 361
  4. 2018Learning Word Vectors for 157 Languagescited by 279
  5. 2020Fighting an Infodemic: COVID-19 Fake News Datasetcited by 82
  6. 2020Hostility Detection Dataset in Hindicited by 31
  7. 2018Detecting Hate Speech and Offensive Language on Twitter using Machine Learning: An N-gram and TFIDF based Approachcited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

6 papers.