Abstract

Knowledge graph question answering is an important technology in intelligent human–robot interaction, which aims at automatically giving answer to human natural language question with the given knowledge graph. For the multi-relation question with higher variety and complexity, the tokens of the question have different priority for the triples selection in the reasoning steps. Most existing models take the question as a whole and ignore the priority information in it. To solve this problem, we propose question-aware memory network for multi-hop question answering, named QA2MN, to update the attention on question timely in the reasoning process. In addition, we incorporate graph context information into knowledge graph embedding model to increase the ability to represent entities and relations. We use it to initialize the QA2MN model and fine-tune it in the training process. We evaluate QA2MN on PathQuestion and WorldCup2014, two representative datasets for complex multi-hop question answering. The result demonstrates that QA2MN achieves state-of-the-art Hits@1 accuracy on the two datasets, which validates the effectiveness of our model.

Details

Title
Question-aware memory network for multi-hop question answering in human–robot interaction
Author
Li Xinmeng 1 ; Alazab Mamoun 2 ; Li, Qian 1 ; Yu, Keping 3 ; Yin Quanjun 1   VIAFID ORCID Logo 

 National University of Defense Technology, College of Systems Engineering, Changsha, China (GRID:grid.412110.7) (ISNI:0000 0000 9548 2110) 
 Charles Darwin University, College of Engineering, IT and Environment, Darwin, Australia (GRID:grid.1043.6) (ISNI:0000 0001 2157 559X) 
 Waseda University, Global Information and Telecommunication Institute, Tokyo, Japan (GRID:grid.5290.e) (ISNI:0000 0004 1936 9975) 
Pages
851-861
Publication year
2022
Publication date
Apr 2022
Publisher
Springer Nature B.V.
ISSN
21994536
e-ISSN
21986053
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2656976049
Copyright
© The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.