GASCOM: Graph-based Attentive Semantic Context Modeling for Online Conversation Understanding
Not on the map. Why?
Abstract (arXiv)
Online conversation understanding is an important yet challenging NLP problem which has many useful applications (e.g., hate speech detection). However, online conversations typically unfold over a series of posts and replies to those posts, forming a tree structure within which individual posts may refer to semantic context from higher up the tree. Such semantic cross-referencing makes it difficult to understand a single post by itself; yet considering the entire conversation tree is not only difficult to scale but can also be misleading as a single conversation may have several distinct threads or points, not all of which are relevant to the post being considered. In this paper, we propose a Graph-based Attentive Semantic COntext Modeling (GASCOM) framework for online conversation understanding. Specifically, we design two novel algorithms that utilise both the graph structure of the online conversation as well as the semantic information from individual posts for retrieving relevant context nodes from the whole conversation. We further design a token-level multi-head graph attention mechanism to pay different attentions to different tokens from different selected context utterances for fine-grained conversation context modeling. Using this semantic conversational context, we re-examine two well-studied problems: polarity prediction and hate speech detection. Our proposed framework significantly outperforms state-of-the-art methods on both tasks, improving macro-F1 scores by 4.5% for polarity prediction and by 5% for hate speech detection. The GASCOM context weights also enhance interpretability.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 56 references that are in the map. First posted on arXiv 21 Oct 2023.
Builds on
24 of 56 references.
References · 24
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018CoQA: A Conversational Question Answering Challengecited by 674
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 491
- 2018QuAC : Question Answering in Contextcited by 379
- 2020Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddingscited by 212
- 2019DialogueGCN: A Graph Convolutional Neural Network for Emotion Recognition in Conversationcited by 184
12 more
- 2016Learning End-to-End Goal-Oriented Dialogcited by 104
- 2020Retrieval-Augmented Generation for Code Summarization via Hybrid GNNcited by 89
- 2017Graph Convolutional Encoders for Syntax-aware Neural Machine Translationcited by 70
- 2019Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generationcited by 57
- 2019GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehensioncited by 41
- 2022GraphNLI: A Graph-based Natural Language Inference Model for Polarity Prediction in Online Debatescited by 14
- 2023CoSyn: Detecting Implicit Hate Speech in Online Conversations Using a Context Synergized Hyperbolic Networkcited by 12
- 2022A Graph-Based Context-Aware Model to Understand Online Conversationscited by 7
- 2020A Dataset Independent Set of Baselines for Relation Prediction in Argument Miningcited by 5
- 2021Unsupervised Identification of Relevant Prior Casescited by 4
- 2021Online Hate: Behavioural Dynamics and Relationship with Misinformationcited by 3
- 2017Speaker-Sensitive Dual Memory Networks for Multi-Turn Slot Taggingcited by 2
Built on by
Not cited yet.