ISSN 1000-1239 CN 11-1777/TP

Journal of Computer Research and Development ›› 2020, Vol. 57 ›› Issue (12): 2514-2522.doi: 10.7544/issn1000-1239.2020.20200741

Special Issue: 2020人机混合增强智能的典型应用专题

Previous Articles     Next Articles

Rule-Guided Joint Embedding Learning of Knowledge Graphs

Yao Siyu1,2, Zhao Tianzhe1,2, Wang Ruijie1,2,3, Liu Jun1,2   

  1. 1(College of Computer Science and Technology, Xi’an Jiaotong University, Xi’an 710049);2(Shaanxi Key Laboratory of STN Technology R&D (Xi’an Jiaotong University), Xi’an 710049);3(Department of Informatics, University of Zurich, Switzerland 8050)
  • Online:2020-12-01
  • Supported by: 
    This work was supported by the National Key Research and Development Program of China (2018YFB1004500), the National Natural Science Foundation of China (61672419, 61672418, 61877050, 61937001), the Consulting Research Project of Chinese Academy of Engineering, the Innovative Research Group Project of the National Natural Science Foundation of China (61721002), the Ministry of Education Innovation Research Team (IRT_17R86), and the Project of China Knowledge Centre for Engineering Science and Technology.

Abstract: In recent years, numerous research works have been devoted to knowledge graph embedding learning which aims to encode entities and relations of the knowledge graph in continuous low-dimensional vector spaces. And the learned embedding representations have been successfully utilized to alleviate the computational inefficiency problem of large-scale knowledge graphs. However, most existing embedding models only consider the structural information of the knowledge graph. The contextual information and literal information are also abundantly contained in knowledge graphs and could be exploited to learn better embedding representations. In this paper, we focus on this problem and propose a rule-guided joint embedding learning model which integrates the contextual information and literal information into the embedding representations of entities and relations based on graph convolutional networks. Especially for the convolutional encoding of the contextual information, we measure the importance of a piece of contextual information by computing its confidence and relatedness metrics. For the confidence metric, we define a simple and effective rule and propose a rule-guided computing method. For the relatedness metric, we propose a computing method based on the representations of the literal information. We conduct extensive experiments on two benchmark datasets, and the experimental results demonstrate the effectiveness of the proposed model.

Key words: knowledge graph, representation learning, graph convolutional networks, contextual information, literal information

CLC Number: