基于知识图的子图检索优化问答模型

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Rui Zhu , Bo Liu , Qiuyu Tian , Ruwen Zhang , Shengxiang Zhang , Yanna Hu , Jiuxin Cao
{"title":"基于知识图的子图检索优化问答模型","authors":"Rui Zhu ,&nbsp;Bo Liu ,&nbsp;Qiuyu Tian ,&nbsp;Ruwen Zhang ,&nbsp;Shengxiang Zhang ,&nbsp;Yanna Hu ,&nbsp;Jiuxin Cao","doi":"10.1016/j.cor.2025.106995","DOIUrl":null,"url":null,"abstract":"<div><div>Knowledge graph-based question answering (QA) is a critical domain within natural language processing, aimed at delivering precise and efficient responses to user queries. Current research predominantly focuses on minimizing subgraph sizes to enhance the efficiency and compactness of the search space. However, natural language queries often exhibit ambiguities, and merely reducing subgraph sizes may overlook relevant answer entities. Additionally, redundant relationships among entities in the knowledge graph can adversely affect QA model performance. To address these limitations, this paper introduces a novel QA model that optimizes subgraph retrieval. The proposed model enhances entity linking and subgraph retrieval by leveraging contextual features from both questions and entities. It disambiguates entities using relevant contextual features and refines the search process through entity relation merging and entity ranking strategies. This methodology improves entity recognition and linking, reduces subgraph dimensions, and broadens answer coverage, resulting in substantial improvements in QA performance. Experimental results on the CCKS2019-CKBQA dataset demonstrate the modelś effectiveness, showing an average F1 score improvement of 2.99% over the leading baseline model. Furthermore, the model’s application in the field of ocean engineering underscores its practical utility and significance.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106995"},"PeriodicalIF":4.3000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Knowledge graph based question-answering model with subgraph retrieval optimization\",\"authors\":\"Rui Zhu ,&nbsp;Bo Liu ,&nbsp;Qiuyu Tian ,&nbsp;Ruwen Zhang ,&nbsp;Shengxiang Zhang ,&nbsp;Yanna Hu ,&nbsp;Jiuxin Cao\",\"doi\":\"10.1016/j.cor.2025.106995\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Knowledge graph-based question answering (QA) is a critical domain within natural language processing, aimed at delivering precise and efficient responses to user queries. Current research predominantly focuses on minimizing subgraph sizes to enhance the efficiency and compactness of the search space. However, natural language queries often exhibit ambiguities, and merely reducing subgraph sizes may overlook relevant answer entities. Additionally, redundant relationships among entities in the knowledge graph can adversely affect QA model performance. To address these limitations, this paper introduces a novel QA model that optimizes subgraph retrieval. The proposed model enhances entity linking and subgraph retrieval by leveraging contextual features from both questions and entities. It disambiguates entities using relevant contextual features and refines the search process through entity relation merging and entity ranking strategies. This methodology improves entity recognition and linking, reduces subgraph dimensions, and broadens answer coverage, resulting in substantial improvements in QA performance. Experimental results on the CCKS2019-CKBQA dataset demonstrate the modelś effectiveness, showing an average F1 score improvement of 2.99% over the leading baseline model. Furthermore, the model’s application in the field of ocean engineering underscores its practical utility and significance.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"177 \",\"pages\":\"Article 106995\"},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2025-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054825000231\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000231","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

基于知识图的问答(QA)是自然语言处理中的一个关键领域,旨在为用户查询提供精确和有效的响应。目前的研究主要集中在最小化子图大小,以提高搜索空间的效率和紧凑性。然而,自然语言查询经常表现出歧义,仅仅减少子图的大小可能会忽略相关的答案实体。此外,知识图中实体之间的冗余关系会对QA模型的性能产生不利影响。为了解决这些限制,本文引入了一种优化子图检索的新型QA模型。该模型通过利用问题和实体的上下文特征来增强实体链接和子图检索。它使用相关的上下文特征来消除实体的歧义,并通过实体关系合并和实体排序策略来改进搜索过程。这种方法提高了实体识别和链接,减少了子图维度,扩大了答案覆盖范围,从而大大提高了QA性能。CCKS2019-CKBQA数据集上的实验结果证明了该模型的有效性,与领先的基线模型相比,平均F1分数提高了2.99%。此外,该模型在海洋工程领域的应用也突出了它的实用性和意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Knowledge graph based question-answering model with subgraph retrieval optimization
Knowledge graph-based question answering (QA) is a critical domain within natural language processing, aimed at delivering precise and efficient responses to user queries. Current research predominantly focuses on minimizing subgraph sizes to enhance the efficiency and compactness of the search space. However, natural language queries often exhibit ambiguities, and merely reducing subgraph sizes may overlook relevant answer entities. Additionally, redundant relationships among entities in the knowledge graph can adversely affect QA model performance. To address these limitations, this paper introduces a novel QA model that optimizes subgraph retrieval. The proposed model enhances entity linking and subgraph retrieval by leveraging contextual features from both questions and entities. It disambiguates entities using relevant contextual features and refines the search process through entity relation merging and entity ranking strategies. This methodology improves entity recognition and linking, reduces subgraph dimensions, and broadens answer coverage, resulting in substantial improvements in QA performance. Experimental results on the CCKS2019-CKBQA dataset demonstrate the modelś effectiveness, showing an average F1 score improvement of 2.99% over the leading baseline model. Furthermore, the model’s application in the field of ocean engineering underscores its practical utility and significance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信