Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks

• URL: http://arxiv.org/abs/2001.06362v1
• Date: Fri, 17 Jan 2020 15:12:08 GMT
• Title: Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks
• Authors: Tian Bian, Xi Xiao, Tingyang Xu, Peilin Zhao, Wenbing Huang, Yu Rong, Junzhou Huang
• Abstract summary: 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.
• Score: 89.13567439679709
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Social media has been developing rapidly in public due to its nature of spreading new information, which leads to rumors being circulated. Meanwhile, detecting rumors from such massive information in social media is becoming an arduous challenge. Therefore, some deep learning methods are applied to discover rumors through the way they spread, such as Recursive Neural Network (RvNN) and so on. However, these deep learning methods only take into account the patterns of deep propagation but ignore the structures of wide dispersion in rumor detection. Actually, propagation and dispersion are two crucial characteristics of rumors. In this paper, 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. Moreover, the information from the source post is involved in each layer of GCN to enhance the influences from the roots of rumors. Encouraging empirical results on several benchmarks confirm the superiority of the proposed method over the state-of-the-art approaches.

Related papers

• Epidemiology-informed Network for Robust Rumor Detection [59.89351792706995]
  We propose a novel Epidemiology-informed Network (EIN) that integrates epidemiological knowledge to enhance performance. To adapt epidemiology theory to rumor detection, it is expected that each users stance toward the source information will be annotated. Our experimental results demonstrate that the proposed EIN not only outperforms state-of-the-art methods on real-world datasets but also exhibits enhanced robustness across varying tree depths.
  arXiv  Detail & Related papers  (2024-11-20T00:43:32Z)
• Diffusion Boosted Trees [56.46631445688882]
  Diffusion Boosted Trees (DBT) can be viewed as both a new denoising diffusion generative model parameterized by decision trees. DBT combines the weak into a strong gradient of conditional distributions without making explicit assumptions on their density forms.
  arXiv  Detail & Related papers  (2024-06-03T22:11:38Z)
• Detecting Rumor Veracity with Only Textual Information by Double-Channel Structure [7.931904787652709]
  We propose a double-channel structure to determine the ex-ante veracity of rumors on social media. We first assign each text into either certain (informed rumor) or uncertain (uninformed rumor) category. Then, we apply lie detection algorithm to informed rumors and thread-reply agreement detection algorithm to uninformed rumors.
  arXiv  Detail & Related papers  (2023-12-06T00:08:44Z)
• Combating Bilateral Edge Noise for Robust Link Prediction [56.43882298843564]
  We propose an information-theory-guided principle, Robust Graph Information Bottleneck (RGIB), to extract reliable supervision signals and avoid representation collapse. Two instantiations, RGIB-SSL and RGIB-REP, are explored to leverage the merits of different methodologies. Experiments on six datasets and three GNNs with diverse noisy scenarios verify the effectiveness of our RGIB instantiations.
  arXiv  Detail & Related papers  (2023-11-02T12:47:49Z)
• Rumor Detection with Diverse Counterfactual Evidence [32.746912322365525]
  Social media has exacerbated the threat of fake news to individuals and communities. prevailing approaches resort to graph neural networks (GNNs) to exploit the post-propagation patterns of the rumor-spreading process. We propose Diverse Counterfactual Evidence framework for Rumor Detection (DCE-RD)
  arXiv  Detail & Related papers  (2023-07-18T14:37:23Z)
• Region-enhanced Deep Graph Convolutional Networks for Rumor Detection [6.5165993338043995]
  A novel region-enhanced deep graph convolutional network (RDGCN) that enhances the propagation features of rumors is proposed. Experiments on Twitter15 and Twitter16 show that the proposed model performs better than the baseline approach on rumor detection and early rumor detection.
  arXiv  Detail & Related papers  (2022-06-15T17:00:11Z)
• 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)
• Identifying Possible Rumor Spreaders on Twitter: A Weak Supervised Learning Approach [0.0]
  We focus on rumors, which is one type of misinformation (other types are fake news, hoaxes, etc). One way to control the spread of the rumors is by identifying users who are possibly the rumor spreaders, that is, users who are often involved in spreading the rumors. We utilize three types of features, that is, user, text, and ego-network features, before applying various supervised learning approaches.
  arXiv  Detail & Related papers  (2020-10-15T10:31:28Z)
• Heterogeneous Graph Attention Networks for Early Detection of Rumors on Twitter [9.358510255345676]
  False rumors on social media can bring about the panic of the public and damage personal reputation. We construct a tweet-word-user heterogeneous graph based on the text contents and the source tweet propagations of rumors.
  arXiv  Detail & Related papers  (2020-06-10T14:49:08Z)
• Distilling Knowledge from Graph Convolutional Networks [146.71503336770886]
  Existing knowledge distillation methods focus on convolutional neural networks (CNNs) We propose the first dedicated approach to distilling knowledge from a pre-trained graph convolutional network (GCN) model. We show that our method achieves the state-of-the-art knowledge distillation performance for GCN models.
  arXiv  Detail & Related papers  (2020-03-23T18:23:11Z)

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.