Question answering over knowledge graphs: a graph-driven approach

Sareh Aghaei, Sepide Masoudi, Tek Raj Chhetri, A. Fensel
{"title":"Question answering over knowledge graphs: a graph-driven approach","authors":"Sareh Aghaei, Sepide Masoudi, Tek Raj Chhetri, A. Fensel","doi":"10.1109/WI-IAT55865.2022.00050","DOIUrl":null,"url":null,"abstract":"With the growth of knowledge graphs (KGs), question answering systems make the KGs easily accessible for end-users. Question answering over KGs aims to provide crisp answers to natural language questions across facts stored in the KGs. This paper proposes a graph-driven approach to answer questions over a KG through four steps, including (1) knowledge subgraph construction, (2) question graph construction, (3) graph matching, and (4) query execution. Given an input question, a knowledge subgraph, which is likely to include the answer is extracted to reduce the KG’s search space. A graph, named question graph, is built to represent the question’s intention. Then, the question graph is matched over the knowledge subgraph to find a query graph corresponding to a SPARQL query. Finally, the corresponding SPARQL is executed to return the answers to the question. The performance of the proposed approach is empirically evaluated using the 6th Question Answering over Linked Data Challenge (QALD-6). Experimental results show that the proposed approach improves the performance compared to the-state-of-art in terms of recall, precision, and F1-score.","PeriodicalId":345445,"journal":{"name":"2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"139 10‐12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT55865.2022.00050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the growth of knowledge graphs (KGs), question answering systems make the KGs easily accessible for end-users. Question answering over KGs aims to provide crisp answers to natural language questions across facts stored in the KGs. This paper proposes a graph-driven approach to answer questions over a KG through four steps, including (1) knowledge subgraph construction, (2) question graph construction, (3) graph matching, and (4) query execution. Given an input question, a knowledge subgraph, which is likely to include the answer is extracted to reduce the KG’s search space. A graph, named question graph, is built to represent the question’s intention. Then, the question graph is matched over the knowledge subgraph to find a query graph corresponding to a SPARQL query. Finally, the corresponding SPARQL is executed to return the answers to the question. The performance of the proposed approach is empirically evaluated using the 6th Question Answering over Linked Data Challenge (QALD-6). Experimental results show that the proposed approach improves the performance compared to the-state-of-art in terms of recall, precision, and F1-score.
基于知识图的问题回答:图驱动的方法
随着知识图谱(KGs)的发展,问答系统使最终用户更容易访问知识图谱。基于KG的问答旨在跨存储在KG中的事实为自然语言问题提供清晰的答案。本文提出了一种图驱动的方法,通过四个步骤(1)知识子图构建、(2)问题图构建、(3)图匹配和(4)查询执行来实现基于KG的问答。给定一个输入问题,提取一个可能包含答案的知识子图,以减少KG的搜索空间。构建了一个图(question graph)来表示问题的意图。然后,在知识子图上匹配问题图,以找到与SPARQL查询相对应的查询图。最后,执行相应的SPARQL以返回问题的答案。使用关联数据挑战(QALD-6)的第6个问题回答对所提出方法的性能进行了经验评估。实验结果表明,该方法在查全率、查准率和f1分数方面都比现有方法有了很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信