Name
Abstract | ||
|---|---|---|
Incompleteness is a common problem for existing knowledge graphs (KGs), and the completion of KG which aims to predict links between entities is challenging. Most existing KG completion methods only consider the direct relation between nodes and ignore the relation paths which contain useful information for link prediction. Recently, a few methods take relation paths into consideration but pay less attention to the order of relations in paths which is important for reasoning. In addition, these path-based models always ignore nonlinear contributions of path features for link prediction. To solve these problems, we propose a novel KG completion method named OPTransE. Instead of embedding both entities of a relation into the same latent space as in previous methods, we project the head entity and the tail entity of each relation into different spaces to guarantee the order of relations in the path. Meanwhile, we adopt a pooling strategy to extract nonlinear and complex features of different paths to further improve the performance of link prediction. Experimental results on two benchmark datasets show that the proposed model OPTransE performs better than state-of-the-art methods. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.18653/v1/D19-1268 | EMNLP/IJCNLP (1) |
DocType | Volume | Citations |
Conference | D19-1 | 2 |
PageRank | References | Authors |
0.37 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yao Zhu | 1 | 2 | 1.04 |
| Hongzhi Liu | 2 | 88 | 14.92 |
| Zhonghai Wu | 3 | 32 | 8.06 |
| Yang Song | 4 | 4 | 1.08 |
| Tao Zhang | 5 | 220 | 69.03 |