Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Message passing for complex question answering over knowledge graphs

: Vakulenko, S.; Fernandez Garcia, J.D.; Polleres, A.; Rijke, M. de; Cochez, M.


Zhu, W. ; Association for Computing Machinery -ACM-:
28th ACM International Conference on Information & Knowledge Management, CIKM 2019. Proceedings : November 3-7, 2019, Beijing, China
New York: ACM, 2019
ISBN: 978-1-4503-6976-3
International Conference on Information & Knowledge Management (CIKM) <28, 2019, Beijing>
Fraunhofer FIT ()

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.