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

基于知识图谱的复杂问答的消息传递

Message Passing for Complex Question Answering over Knowledge Graphs

Vienna University of Economics and Business(维也纳经济大学);University of Amsterdam(阿姆斯特丹大学);Fraunhofer FIT(弗劳恩霍夫应用信息技术研究所)

Svitlana Vakulenko, Javier David Fernandez Garcia, Axel Polleres, Maarten de Rijke, Michael Cochez

摘要:

基于知识图谱的问答(KGQA)已经从简单的单一事实问题发展到需要图遍历和聚合的复杂问题。我们提出了一种新的方法,复杂的KGQA,使用无监督的消息传递,传播的置信度得分通过解析输入的问题和匹配的知识图谱中的一组可能的答案。首先,我们识别自然语言问题中提到的实体、关系和类名,并将它们映射到图中的对应项。然后,这些映射的置信度得分通过图结构传播以定位答案实体。最后,根据所识别的问题类型对这些问题进行汇总。这种方法可以有效地实现为一系列稀疏矩阵乘法模仿连接在小的局部子图。我们的评估结果表明,所提出的方法优于国家的最先进的LC-QuAD基准。此外,我们表明,该方法的性能只取决于问题解释结果的质量,即,给定正确的相关性分数分布,我们的方法总是产生正确的答案排名。我们的错误分析揭示了基准数据集中缺少的正确答案和DBpedia知识图谱中的不一致性。最后,我们提供了一个全面的评估所提出的方法伴随着消融研究和错误分析,更详细地展示了每个问答组件的陷阱。

英文摘要:

Question answering over knowledge graphs (KGQA) has evolved from simple single-fact questions to complex questions that require graph traversal and aggregation. We propose a novel approach for complex KGQA that uses unsupervised message passing, which propagates confidence scores obtained by parsing an input question and matching terms in the knowledge graph to a set of possible answers. First, we identify entity, relationship, and class names mentioned in a natural language question, and map these to their counterparts in the graph. Then, the confidence scores of these mappings propagate through the graph structure to locate the answer entities. Finally, these are aggregated depending on the identified question type. This approach can be efficiently implemented as a series of sparse matrix multiplications mimicking joins over small local subgraphs. Our evaluation results show that the proposed approach outperforms the state-of-the-art on the LC-QuAD benchmark. Moreover, we show that the performance of the approach depends only on the quality of the question interpretation results, i.e., given a correct relevance score distribution, our approach always produces a correct answer ranking. Our error analysis reveals correct answers missing from the benchmark dataset and inconsistencies in the DBpedia knowledge graph. Finally, we provide a comprehensive evaluation of the proposed approach accompanied with an ablation study and an error analysis, which showcase the pitfalls for each of the question answering components in more detail.

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

↑