Log In Sign Up

Convolutional Complex Knowledge Graph Embeddings

by   Caglar Demir, et al.

In this paper, we study the problem of learning continuous vector representations of knowledge graphs for predicting missing links. We present a new approach called ConEx, which infers missing links by leveraging the composition of a 2D convolution with a Hermitian inner product of complex-valued embedding vectors. We evaluate ConEx against state-of-the-art approaches on the WN18RR, FB15K-237, KINSHIP and UMLS benchmark datasets. Our experimental results show that ConEx achieves a performance superior to that of state-of-the-art approaches such as RotatE, QuatE and TuckER on the link prediction task on all datasets while requiring at least 8 times fewer parameters. We ensure the reproducibility of our results by providing an open-source implementation which includes the training, evaluation scripts along with pre-trained models at


page 1

page 2

page 3

page 4


Convolutional Hypercomplex Embeddings for Link Prediction

Knowledge graph embedding research has mainly focused on the two smalles...

Kronecker Decomposition for Knowledge Graph Embeddings

Knowledge graph embedding research has mainly focused on learning contin...

A shallow neural model for relation prediction

Knowledge graph completion refers to predicting missing triples. Most ap...

Out-of-Vocabulary Entities in Link Prediction

Knowledge graph embedding techniques are key to making knowledge graphs ...

DRILL– Deep Reinforcement Learning for Refinement Operators in 𝒜ℒ𝒞

Approaches based on refinement operators have been successfully applied ...

Knowledge Graph Embedding with Atrous Convolution and Residual Learning

Knowledge graph embedding is an important task and it will benefit lots ...

Are Missing Links Predictable? An Inferential Benchmark for Knowledge Graph Completion

We present InferWiki, a Knowledge Graph Completion (KGC) dataset that im...

Code Repositories