Complex and Holographic Embeddings of Knowledge Graphs: A Comparison

07/05/2017
by   Maximilian Nickel, et al.
0

Embeddings of knowledge graphs have received significant attention due to their excellent performance for tasks like link prediction and entity resolution. In this short paper, we are providing a comparison of two state-of-the-art knowledge graph embeddings for which their equivalence has recently been established, i.e., ComplEx and HolE [Nickel, Rosasco, and Poggio, 2016; Trouillon et al., 2016; Hayashi and Shimbo, 2017]. First, we briefly review both models and discuss how their scoring functions are equivalent. We then analyze the discrepancy of results reported in the original articles, and show experimentally that they are likely due to the use of different loss functions. In further experiments, we evaluate the ability of both models to embed symmetric and antisymmetric patterns. Finally, we discuss advantages and disadvantages of both models and under which conditions one would be preferable to the other.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2017

TorusE: Knowledge Graph Embedding on a Lie Group

Knowledge graphs are useful for many artificial intelligence (AI) tasks....
research
05/15/2020

Benchmarking neural embeddings for link prediction in knowledge graphs under semantic and structural changes

Recently, link prediction algorithms based on neural embeddings have gai...
research
07/24/2022

AutoWeird: Weird Translational Scoring Function Identified by Random Search

Scoring function (SF) measures the plausibility of triplets in knowledge...
research
07/01/2019

Augmenting and Tuning Knowledge Graph Embeddings

Knowledge graph embeddings rank among the most successful methods for li...
research
03/12/2019

Interaction Embeddings for Prediction and Explanation in Knowledge Graphs

Knowledge graph embedding aims to learn distributed representations for ...
research
03/01/2023

Enhancing Knowledge Graph Embedding Models with Semantic-driven Loss Functions

Knowledge graph embedding models (KGEMs) are used for various tasks rela...
research
07/09/2019

Adaptive Margin Ranking Loss for Knowledge Graph Embeddings via a Correntropy Objective Function

Translation-based embedding models have gained significant attention in ...

Please sign up or login with your details

Forgot password? Click here to reset