arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.09207cs.CLcs.AIcs.CY
收藏

一种基于图的上下文感知模型以理解在线对话

A Graph-Based Context-Aware Model to Understand Online Conversations

University of Surrey(萨里大学);King’s College London(伦敦国王学院)

Vibhor Agarwal, Anthony P. Young, Sagar Joglekar, Nishanth Sastry

AI总结:

提出基于图的深度学习架构GraphNLI,通过图游走采样并聚合对话的周边上下文,在极性预测和仇恨言论检测任务上显著优于基线模型。

摘要:

允许用户参与互动的在线论坛改变了许多重要议题的公众讨论方式。然而,此类对话有时会升级为彻底的仇恨和错误信息交流。自然语言处理(NLP)中的现有方法,例如用于分类任务的深度学习模型,仅将单条评论或一对评论作为输入,这分别取决于任务是推断单条评论的属性还是评论对之间的回复关系。但在在线对话中,评论和回复可能基于输入模型的直接相关信息之外的上下文。因此,感知对话的周边上下文应能提升模型在当前推断任务上的性能。我们提出了GraphNLI,这是一种新颖的基于图的深度学习架构,它以有原则的方式使用图游走来纳入对话的更广泛上下文。具体而言,图游走从给定评论开始,并在相同或平行对话线程中采样“附近”评论,从而生成额外的嵌入,这些嵌入与初始评论的嵌入聚合在一起。然后,我们将这些丰富的嵌入用于对在线对话至关重要的下游NLP预测任务。我们在两个此类任务上评估了GraphNLI——极性预测和厌女仇恨言论检测——并发现我们的模型在两项任务上始终优于所有相关基线。具体而言,带有偏向寻根随机游走的GraphNLI在极性预测和仇恨言论检测任务上,其macro-F1分数分别比表现最好的基于BERT的基线高出3和6个百分点。

英文摘要:

Online forums that allow for participatory engagement between users have been transformative for the public discussion of many important issues. However, such conversations can sometimes escalate into full-blown exchanges of hate and misinformation. Existing approaches in natural language processing (NLP), such as deep learning models for classification tasks, use as inputs only a single comment or a pair of comments depending upon whether the task concerns the inference of properties of the individual comments or the replies between pairs of comments, respectively. But in online conversations, comments and replies may be based on external context beyond the immediately relevant information that is input to the model. Therefore, being aware of the conversations' surrounding contexts should improve the model's performance for the inference task at hand. We propose GraphNLI, a novel graph-based deep learning architecture that uses graph walks to incorporate the wider context of a conversation in a principled manner. Specifically, a graph walk starts from a given comment and samples "nearby" comments in the same or parallel conversation threads, which results in additional embeddings that are aggregated together with the initial comment's embedding. We then use these enriched embeddings for downstream NLP prediction tasks that are important for online conversations. We evaluate GraphNLI on two such tasks - polarity prediction and misogynistic hate speech detection - and found that our model consistently outperforms all relevant baselines for both tasks. Specifically, GraphNLI with a biased root-seeking random walk performs with a macro-F1 score of 3 and 6 percentage points better than the best-performing BERT-based baselines for the polarity prediction and hate speech detection tasks, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑