Knowledge graph (KG) completion aims at predicting the unknown links between entities and relations. In this paper, we focus on this task through embedding a KG into a latent space. Existing embedding based approaches such as TransH usually perform the same operation on head and tail entities in a triple. Such way could ignore the different roles of head and tail entities in a relation. To resolve this problem, this paper proposes a novel method for KGs embedding by preforming bi-directional projections on head and tail entities. In this way, the different information of an entity could be elaborately captured when it plays different roles for a relation. The experimental results on multiple benchmark datasets demonstrate that our method significantly outperforms state-of-the-art methods.
CITATION STYLE
Luo, W., Zuo, J., & Gao, Z. (2016). Knowledge graph completion by embedding with bi-directional projections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9773, pp. 767–779). Springer Verlag. https://doi.org/10.1007/978-3-319-42297-8_71
Mendeley helps you to discover research relevant for your work.