mlsanityData to 7 Oct 2026

Meta-Path-based Fake News Detection Leveraging Multi-level Social Context Information

arXiv 2109.08022 ↗First posted 13 Sep 2021cs.SI cs.AI cs.CYcited by 8

Not on the map. Why?

Abstract (arXiv)

Fake news, false or misleading information presented as news, has a significant impact on many aspects of society, such as in politics or healthcare domains. Due to the deceiving nature of fake news, applying Natural Language Processing (NLP) techniques to the news content alone is insufficient. The multi-level social context information (news publishers and engaged users in social media) and temporal information of user engagement are important information in fake news detection. The proper usage of this information, however, introduces three chronic difficulties: 1) multi-level social context information is hard to be used without information loss, 2) temporal information is hard to be used along with multi-level social context information, 3) news representation with multi-level social context and temporal information is hard to be learned in an end-to-end manner. To overcome all three difficulties, we propose a novel fake news detection framework, Hetero-SCAN. We use Meta-Path to extract meaningful multi-level social context information without loss. Meta-Path, a composite relation connecting two node types, is proposed to capture the semantics in the heterogeneous graph. We then propose Meta-Path instance encoding and aggregation methods to capture the temporal information of user engagement and produce news representation end-to-end. According to our experiment, Hetero-SCAN yields significant performance improvement over state-of-the-art fake news detection methods.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 24 of its 52 references that are in the map. First posted on arXiv 13 Sep 2021.

Builds on

24 of 52 references.

References · 24

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  5. 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
  6. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  7. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  8. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
  9. 2019Heterogeneous Graph Attention Networkcited by 732
  10. 2017Convolutional 2D Knowledge Graph Embeddingscited by 729
  11. 2014Distributed Representations of Sentences and Documentscited by 677
  12. 2020MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embeddingcited by 304
12 more
  1. 2020Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networkscited by 152
  2. 2017Automatic Detection of Fake Newscited by 145
  3. 2017CSI: A Hybrid Deep Model for Fake News Detectioncited by 101
  4. 2020FANG: Leveraging Social Context for Fake News Detection Using Graph Representationcited by 98
  5. 2017Beyond News Contents: The Role of Social Context for Fake News Detectioncited by 91
  6. 2017A Stylometric Inquiry into Hyperpartisan and Fake Newscited by 81
  7. 2020Graph Neural Networks with Continual Learning for Fake News Detection from Social Mediacited by 43
  8. 2019The Role of User Profile for Fake News Detectioncited by 41
  9. 2020Ginger Cannot Cure Cancer: Battling Fake Health News with a Comprehensive Data Repositorycited by 25
  10. 2020Graph-based Modeling of Online Communities for Fake News Detectioncited by 21
  11. 2021Adversarial Active Learning based Heterogeneous Graph Neural Network for Fake News Detectioncited by 21
  12. 2021Hierarchical Multi-head Attentive Network for Evidence-aware Fake News Detectioncited by 17

Built on by

Cited by year (2026 to 7 Oct)

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

8 papers.