Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ma, Dongdonga | He, Xiaohaia; * | Wang, Meilinga | Fang, Qingmaob | Zhu, Hana | Hu, Pingb
Affiliations: [a] College of Electronics and Information Engineering, Sichuan University, Chengdu, Sichuan, China | [b] Sichuan Academy of Traditional Chinese Medicine, Chengdu, Sichuan, China
Correspondence: [*] Corresponding author. Xiaohai He, College of Electronics and Information Engineering, Sichuan University, Chengdu, Sichuan, 610065, China. E-mail:hxh@scu.edu.cn.
Abstract: Knowledge graph question answering aims to answer natural language questions using structured knowledge graph data. The key to achieving this is having a correct semantic understanding of the question phrases. Query graph generation is an important step for knowledge graph question answering systems to tackle complex questions. Unlike simple single-hop questions, complex questions often require reasoning between multiple triples to get the right answer due to multiple entities, relationships and constraints, making it difficult to generate correct query graphs. In previous studies, researchers have primarily focused on improving the extraction and representation of question features, neglecting the prior structural information implicated in the question itself. In this paper, we propose a question structure classifier to classify the question structure, and alleviate the noise interference in query graph through classification results. In the classifier, we strengthen the information about the question structure through the attention mechanism, while weakening the irrelevant information. Moreover, a query graph sorting module based on feature cross-coding is proposed to sort candidate paths in the query graph using fine-grained feature interaction between words. Extensive experiments are conducted on two public datasets (MetaQA and WebQuestionsSP) and the experimental results show that the proposed method outperforms other baselines.
Keywords: Knowledge graph question answering, relation embedding, attention enhancement, feature cross-encoding
DOI: 10.3233/JIFS-233650
Journal: Journal of Intelligent & Fuzzy Systems, vol. Pre-press, no. Pre-press, pp. 1-15, 2024
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl