5F Knowledge Graph Embeddings with Projective Transformations

29Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

Abstract

Performing link prediction using knowledge graph embedding models has become a popular approach for knowledge graph completion. Such models employ a transformation function that maps nodes via edges into a vector space in order to measure the likelihood of the links. While mapping the individual nodes, the structure of subgraphs is also transformed. Most of the embedding models designed in Euclidean geometry usually support a single transformation type – often translation or rotation, which is suitable for learning on graphs with small differences in neighboring subgraphs. However, multi-relational knowledge graphs often include multiple subgraph structures in a neighborhood (e.g. combinations of path and loop structures), which current embedding models do not capture well. To tackle this problem, we propose a novel KGE model (5FE) in projective geometry, which supports multiple simultaneous transformations – specifically inversion, reflection, translation, rotation, and homothety. The model has several favorable theoretical properties and subsumes the existing approaches. It outperforms them on most widely used link prediction benchmarks.

Cite

CITATION STYLE

APA

Nayyeri, M., Vahdati, S., Aykul, C., & Lehmann, J. (2021). 5F Knowledge Graph Embeddings with Projective Transformations. In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 10B, pp. 9064–9072). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v35i10.17095

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free