During the upcoming colloquium, Nilesh Chakraborty will give a short introduction on factorising RDF tensors and present a paper on “Holographic Embeddings of Knowledge Graphs”:
Holographic Embeddings of Knowledge Graphs
Authors: Maximilian Nickel, Lorenzo Rosasco, Tomaso Poggio
Abstract: 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. In extensive experiments we show that holographic embeddings are able to outperform state-of-the-art methods for link prediction in knowledge graphs and relational learning benchmark datasets.
