TuckER: Tensor Factorization for Knowledge Graph Completion

By Ivana Balazevic, Carl Allen, Timothy M. Hospedales. 2019

904 citations recorded by the source corpus.

Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones. We propose TuckER, a relatively straightforward but powerful linear model based on Tucker decomposition of the binary tensor representation of knowledge graph triples. TuckER outperforms previous state-of-the-art models across standard link prediction datasets, acting as a strong baseline for more elaborate models. We show that TuckER is a fully expressive model, derive sufficient bounds on its embedding dimensionalities and demonstrate that several previously introduced linear models can be viewed as special cases of TuckER.

Subfields: Artificial Intelligence, Computational Mathematics, Knowledge Graphs & Representation

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Jianfeng Gao
  3. Percy Liang
  4. Noah A. Smith
  5. Luke S. Zettlemoyer
  6. Yejin Choi
  7. Zhiyuan Liu
  8. Quoc V. Le

In Computational Mathematics

  1. Partha P. Talukdar
  2. Apoorv Saxena
  3. Aditay Tripathi
  4. Sameer Singh
  5. Ivana Balazevic
  6. Carl Allen
  7. Pouya Pezeshkpour
  8. Yifan Tian

In Knowledge Graphs & Representation

  1. Partha P. Talukdar
  2. Apoorv Saxena
  3. Sameer Singh
  4. Pouya Pezeshkpour
  5. Aditay Tripathi
  6. Yifan Tian
  7. Timothy M. Hospedales
  8. Ivana Balazevic

Citations in the corpus