论文标题
可解释的错误信息检测的链接信誉评论
Linked Credibility Reviews for Explainable Misinformation Detection
论文作者
论文摘要
近年来,网络上的错误信息变得越来越猖ramp。研究界通过提出的系统和挑战做出了回应,这些系统和挑战开始对检测错误信息的(各种子任务)有用。但是,大多数提出的系统都是基于对特定域进行微调的深度学习技术,很难解释和产生不可读取的结果。这限制了他们的适用性和采用,因为它们只能在非常特定的设置中被选定的专家受众使用。在本文中,我们提出了一个基于信誉审查(CRS)的核心概念的体系结构,该体系结构可用于构建分布式机器人网络,以合作进行错误信息检测。 CRS是组成(i)Web内容,(ii)现有信誉信号的构建块 - 网站对网站的索赔和声誉审查 - 以及(iii)自动计算的评论。我们以轻质扩展为Schema.org和服务为语义相似性和立场检测提供通用的NLP任务。对现有社会媒体帖子,虚假新闻和政治演讲的现有数据集的评估证明了与现有系统相比的几个优势:可扩展性,独立于域,合并性,可解释性和透明度,通过出处。此外,我们获得了竞争成果,而无需进行填充,并在Clef'18 Checkthat上建立新的最新技术!事实任务。
In recent years, misinformation on the Web has become increasingly rampant. The research community has responded by proposing systems and challenges, which are beginning to be useful for (various subtasks of) detecting misinformation. However, most proposed systems are based on deep learning techniques which are fine-tuned to specific domains, are difficult to interpret and produce results which are not machine readable. This limits their applicability and adoption as they can only be used by a select expert audience in very specific settings. In this paper we propose an architecture based on a core concept of Credibility Reviews (CRs) that can be used to build networks of distributed bots that collaborate for misinformation detection. The CRs serve as building blocks to compose graphs of (i) web content, (ii) existing credibility signals --fact-checked claims and reputation reviews of websites--, and (iii) automatically computed reviews. We implement this architecture on top of lightweight extensions to Schema.org and services providing generic NLP tasks for semantic similarity and stance detection. Evaluations on existing datasets of social-media posts, fake news and political speeches demonstrates several advantages over existing systems: extensibility, domain-independence, composability, explainability and transparency via provenance. Furthermore, we obtain competitive results without requiring finetuning and establish a new state of the art on the Clef'18 CheckThat! Factuality task.