Holographic Embeddings of Knowledge Graphs

By Maximilian Nickel, Lorenzo Rosasco, Tomaso A. Poggio. 2015

1,271 citations recorded by the source corpus.

Learning embeddings of entities and relations is an efficient and versatile method to perform machine learning on relational data such as knowledge graphs. In this work, we propose holographic embeddings (HolE) to learn compositional vector space representations of entire knowledge graphs. The proposed method is related to holographic models of associative memory in that it employs circular correlation to create compositional representations. By using correlation as the compositional operator, HolE can capture rich interactions but simultaneously remains efficient to compute, easy to train, and scalable to very large datasets. Experimentally, we show that holographic embeddings are able to outperform state-of-the-art methods for link prediction on knowledge graphs and relational learning benchmark datasets.

Subfields: Artificial Intelligence, Management Science and Operations Research, Representation & Self-Supervised Learning, 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. Zhiyuan Liu
  4. Percy Liang
  5. Luke S. Zettlemoyer
  6. Yoshua Bengio
  7. Maosong Sun
  8. Sebastian Riedel

In Management Science and Operations Research

  1. Wei Hu
  2. Zequn Sun
  3. Tim Weninger
  4. Baoxu Shi
  5. Xiang Wang
  6. Xiangnan He
  7. Tat-seng Chua
  8. Lingbing Guo

In Representation & Self-Supervised Learning

  1. Bilal Abu-Salih
  2. Partha P. Talukdar
  3. Seyed Mehran Kazemi
  4. Xiang Wang
  5. Xing Xie
  6. Xiangnan He
  7. Tat-seng Chua
  8. Jure Leskovec

In Knowledge Graphs & Representation

  1. Xing Xie
  2. Hongwei Wang
  3. Miao Zhao
  4. Wenjie Li
  5. Xiangnan He
  6. Fuzheng Zhang
  7. Minyi Guo
  8. Bilal Abu-Salih

Citations in the corpus