基于对比学习和特征转换的知识图谱问答

Xinrong Hu, Jingjing Huang, Junping Liu, Qiang Zhu, J. Yang
{"title":"基于对比学习和特征转换的知识图谱问答","authors":"Xinrong Hu, Jingjing Huang, Junping Liu, Qiang Zhu, J. Yang","doi":"10.1109/QRS-C57518.2022.00097","DOIUrl":null,"url":null,"abstract":"Traditional Knowledge Graph Question Answering(KGQA) usually focuses on entity recognition and relation detection. Common relation detection methods cannot detect new relations without corresponding word entries in the system, and the propagation of errors leads to the loss of some semantic similarity information. In this paper, we propose an end-to-end knowledge graph question-answering framework (TransCL). Latent knowledge is first mined from the knowledge base and augmented information is generated in the form of question-answer pairs. Positive features are then transformed into difficult positive features using a feature transformation method based on positive extrapolation. We use contrastive learning methods to aggregate vectors and retain the original information, capturing deep matching features between data samples by contrast. TransCL is more capable of fuzzy matching and dealing with unknown inputs. Experiments show that our method achieves an F1 score of 85.50% on the NLPCC-ICCPOL-2016 open domain QA dataset.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"22 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Knowledge Graph Question Answering based on Contrastive Learning and Feature Transformation\",\"authors\":\"Xinrong Hu, Jingjing Huang, Junping Liu, Qiang Zhu, J. Yang\",\"doi\":\"10.1109/QRS-C57518.2022.00097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional Knowledge Graph Question Answering(KGQA) usually focuses on entity recognition and relation detection. Common relation detection methods cannot detect new relations without corresponding word entries in the system, and the propagation of errors leads to the loss of some semantic similarity information. In this paper, we propose an end-to-end knowledge graph question-answering framework (TransCL). Latent knowledge is first mined from the knowledge base and augmented information is generated in the form of question-answer pairs. Positive features are then transformed into difficult positive features using a feature transformation method based on positive extrapolation. We use contrastive learning methods to aggregate vectors and retain the original information, capturing deep matching features between data samples by contrast. TransCL is more capable of fuzzy matching and dealing with unknown inputs. Experiments show that our method achieves an F1 score of 85.50% on the NLPCC-ICCPOL-2016 open domain QA dataset.\",\"PeriodicalId\":183728,\"journal\":{\"name\":\"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)\",\"volume\":\"22 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QRS-C57518.2022.00097\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QRS-C57518.2022.00097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

传统的知识图谱问答(Knowledge Graph Question answer, KGQA)通常侧重于实体识别和关系检测。常用的关系检测方法无法检测到系统中没有对应词项的新关系,并且错误的传播导致一些语义相似信息的丢失。本文提出了一个端到端的知识图谱问答框架(TransCL)。首先从知识库中挖掘潜在知识,并以问答对的形式生成增强信息。然后利用基于正外推的特征转换方法将正特征转换为难正特征。我们使用对比学习方法聚合向量并保留原始信息,通过对比捕捉数据样本之间的深度匹配特征。TransCL具有更强的模糊匹配能力和处理未知输入的能力。实验表明,该方法在nlpcc - iccpl -2016开放域QA数据集上获得了85.50%的F1分数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Knowledge Graph Question Answering based on Contrastive Learning and Feature Transformation
Traditional Knowledge Graph Question Answering(KGQA) usually focuses on entity recognition and relation detection. Common relation detection methods cannot detect new relations without corresponding word entries in the system, and the propagation of errors leads to the loss of some semantic similarity information. In this paper, we propose an end-to-end knowledge graph question-answering framework (TransCL). Latent knowledge is first mined from the knowledge base and augmented information is generated in the form of question-answer pairs. Positive features are then transformed into difficult positive features using a feature transformation method based on positive extrapolation. We use contrastive learning methods to aggregate vectors and retain the original information, capturing deep matching features between data samples by contrast. TransCL is more capable of fuzzy matching and dealing with unknown inputs. Experiments show that our method achieves an F1 score of 85.50% on the NLPCC-ICCPOL-2016 open domain QA dataset.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信