吉林大学学报(理学版) ›› 2022, Vol. 60 ›› Issue (1): 119-0126.

• • 上一篇    下一篇

基于知识图谱嵌入的多跳中文知识问答方法

张天杭, 李婷婷, 张永刚   

  1. 吉林大学 计算机科学与技术学院, 符号计算与知识工程教育部重点实验室, 长春 130012
  • 收稿日期:2020-12-17 出版日期:2022-01-26 发布日期:2022-01-26
  • 通讯作者: 张永刚 E-mail:zhangyg@jlu.edu.cn

Multi-hop Chinese Knowledge Question Answering Method Based on Knowledge Graph Embedding

ZHANG Tianhang, LI Tingting, ZHANG Yonggang   

  1. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2020-12-17 Online:2022-01-26 Published:2022-01-26

摘要: 基于知识图谱嵌入模型, 提出一种知识图谱嵌入评分与链路评分相结合的评分方法, 以解决中文领域的多跳知识图谱问答任务, 与传统的单跳知识问答方法相比适用性更广. 该方法在搜索最优答案的同时构建一个查询链路, 通过查询给出答案集合, 从而有效缓解了现有方法中遗漏答案的情况. 在NLPCC-MH数据集上的实验结果表明, 该方法在多跳问题上的平均F1值为0.653, 显著优于对比方法. 真实知识图谱通常存在链路缺失的情况, 实验以随机丢弃25%三元组的方式模拟了知识图谱的稀疏性, 结果表明该方法在这种情况下仍然有效.

关键词: 知识图谱, 智能问答, 知识图谱嵌入, 链路预测

Abstract: Based on the knowledge graph embedding model, we proposed a scoring method combining knowledge graph embedding scoring and link scoring to solve multi-hop knowledge graph question answering task in the Chinese domain, which had wider applicability compared with the traditional single-hop knowledge question answering methods. The method constructed a query link while searching for the optimal answer, and gave the answer set by query, which effectively alleviated the situation of missing answers in existing methods. The experimental results on the NLPCC-MH dataset show that the average F1 value of the method on multi-hop problems is 0.653, which is significantly better than the comparison method. Real knowledge graphs usually have missing links, and the experiments simulate the sparsity of knowledge graphs by randomly discarding 25% triples, the results show that the method is still effective in this case.

Key words: knowledge graph, intelligent question answering, knowledge graph embedding, link prediction

中图分类号: 

  • TP391.1