摘要
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.
| 投稿的翻译标题 | Rule-Guided Joint Embedding Learning of Knowledge Graphs |
|---|---|
| 源语言 | 繁体中文 |
| 页(从-至) | 2514-2522 |
| 页数 | 9 |
| 期刊 | Jisuanji Yanjiu yu Fazhan/Computer Research and Development |
| 卷 | 57 |
| 期 | 12 |
| DOI | |
| 出版状态 | 已出版 - 12月 2020 |
关键词
- Contextual information
- Graph convolutional networks
- Knowledge graph
- Literal information
- Representation learning
学术指纹
探究 '规则引导的知识图谱联合嵌入方法' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver