Model-Agnostic and Diverse Explanations for Streaming Rumour Graphs

• URL: http://arxiv.org/abs/2207.08098v1
• Date: Sun, 17 Jul 2022 07:13:27 GMT
• Title: Model-Agnostic and Diverse Explanations for Streaming Rumour Graphs
• Authors: Thanh Tam Nguyen and Thanh Cong Phan and Minh Hieu Nguyen and Matthias Weidlich and Hongzhi Yin and Jun Jo and Quoc Viet Hung Nguyen
• Abstract summary: We argue that explanations for detected rumours may be given in terms of examples of related rumours detected in the past. A diverse set of similar rumours helps users to generalize, i.e., to understand the properties that govern the detection of rumours.
• Score: 39.88818563103125
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The propagation of rumours on social media poses an important threat to societies, so that various techniques for rumour detection have been proposed recently. Yet, existing work focuses on \emph{what} entities constitute a rumour, but provides little support to understand \emph{why} the entities have been classified as such. This prevents an effective evaluation of the detected rumours as well as the design of countermeasures. In this work, we argue that explanations for detected rumours may be given in terms of examples of related rumours detected in the past. A diverse set of similar rumours helps users to generalize, i.e., to understand the properties that govern the detection of rumours. Since the spread of rumours in social media is commonly modelled using feature-annotated graphs, we propose a query-by-example approach that, given a rumour graph, extracts the $k$ most similar and diverse subgraphs from past rumours. The challenge is that all of the computations require fast assessment of similarities between graphs. To achieve an efficient and adaptive realization of the approach in a streaming setting, we present a novel graph representation learning technique and report on implementation considerations. Our evaluation experiments show that our approach outperforms baseline techniques in delivering meaningful explanations for various rumour propagation behaviours.

Related papers

• 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)
• Generating Zero-shot Abstractive Explanations for Rumour Verification [46.897767694062004]
  We reformulate the task to generate model-centric free-text explanations of a rumour's veracity. We exploit the few-shot learning capabilities of a large language model (LLM) Our experiments show that LLMs can have similar agreement to humans in evaluating summaries.
  arXiv  Detail & Related papers  (2024-01-23T12:29:37Z)
• 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)
• 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)
• Zero-Shot Rumor Detection with Propagation Structure via Prompt Learning [24.72097408129496]
  Previous studies reveal that due to the lack of annotated resources, rumors presented in minority languages are hard to be detected. We propose a novel framework based on prompt learning to detect rumors falling in different domains or presented in different languages. Our proposed model achieves much better performance than state-of-the-art methods and exhibits a superior capacity for detecting rumors at early stages.
  arXiv  Detail & Related papers  (2022-12-02T12:04:48Z)
• 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)
• Robust Contrastive Learning against Noisy Views [79.71880076439297]
  We propose a new contrastive loss function that is robust against noisy views. We show that our approach provides consistent improvements over the state-of-the-art image, video, and graph contrastive learning benchmarks.
  arXiv  Detail & Related papers  (2022-01-12T05:24:29Z)
• Rumor Detection on Twitter with Claim-Guided Hierarchical Graph Attention Networks [5.167857972528786]
  Rumors are rampant in the era of social media. In this study, to substantially reinforces the interaction of user opinions, we first represent the conversation thread as an undirected interaction graph. We then present a Claim-guided Hierarchical Graph Attention Network for rumor classification, which enhances the representation learning for responsive posts.
  arXiv  Detail & Related papers  (2021-10-09T09:24:11Z)
• ExplaGraphs: An Explanation Graph Generation Task for Structured Commonsense Reasoning [65.15423587105472]
  We present a new generative and structured commonsense-reasoning task (and an associated dataset) of explanation graph generation for stance prediction. Specifically, given a belief and an argument, a model has to predict whether the argument supports or counters the belief and also generate a commonsense-augmented graph that serves as non-trivial, complete, and unambiguous explanation for the predicted stance. A significant 83% of our graphs contain external commonsense nodes with diverse structures and reasoning depths.
  arXiv  Detail & Related papers  (2021-04-15T17:51:36Z)
• 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.