Knowledge Graph Reasoning Based on Tensor Decomposition and MHRP-Learning

Author:

Huang Tangsen1ORCID,Li Xiaowu1,Zhai Sheping2,Wei Juanli3

Affiliation:

1. School of Electronics and Information Engineering, Hunan University of Science and Engineering, Yongzhou 425199, China

2. Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing, Xi’an University of Posts and Telecommunications, Xi’an, Shaanxi 710121, China

3. Network Information Center, Xi’an Physical Education University, Xi’an, Shaanxi 710068, China

Abstract

In the process of learning and reasoning knowledge graph, the existing tensor decomposition technology only considers the direct relationship between entities in knowledge graph. However, it ignores the characteristics of the graph structure of knowledge graph. To solve this problem, a knowledge graph reasoning algorithm based on multihop relational paths learning (MHRP-learning) and tensor decomposition is proposed in this paper. Firstly, MHRP-learning is adopted to obtain the relationship path between entity pairs in the knowledge graph. Then, the tensor decomposition is performed to get a novel learning framework. Finally, experiments show that the proposed method achieves advanced results, and it is applicable to knowledge graph reasoning.

Funder

Natural Science Foundation of Hunan Province

Publisher

Hindawi Limited

Subject

General Computer Science

Reference25 articles.

1. Principles of semantic networks: exploration in the representation of knowledge;J. F. Sowa;Frame Problem in Articial Intelligence,1991

2. Technologies for machine translation

3. Natural language question-answering systems;R. F. Simmons;Communications of the ACM,1969

4. Truly parallel understanding of text;Y. H. Yu

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3