TL;DR
This paper introduces an unsupervised message passing method for complex question answering over knowledge graphs, improving accuracy by propagating confidence scores through graph structures and outperforming existing methods on benchmark datasets.
Contribution
The paper presents a novel unsupervised message passing approach for complex KGQA that efficiently propagates confidence scores and outperforms state-of-the-art methods on LC-QuAD.
Findings
Outperforms state-of-the-art on LC-QuAD benchmark
Performance depends on question interpretation quality
Error analysis reveals dataset and knowledge graph issues
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
