Learning Sequence Encoders for Temporal Knowledge Graph Completion

09/10/2018
by   Alberto García-Durán, et al.
0

Research on link prediction in knowledge graphs has mainly focused on static multi-relational data. In this work we consider temporal knowledge graphs where relations between entities may only hold for a time interval or a specific point in time. In line with previous work on static knowledge graphs, we propose to address this problem by learning latent entity and relation type representations. To incorporate temporal information, we utilize recurrent neural networks to learn time-aware representations of relation types which can be used in conjunction with existing latent factorization methods. The proposed approach is shown to be robust to common challenges in real-world KGs: the sparsity and heterogeneity of temporal expressions. Experiments show the benefits of our approach on four temporal KGs. The data sets are available under a permissive BSD-3 license 1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2021

ChronoR: Rotation Based Temporal Knowledge Graph Embedding

Despite the importance and abundance of temporal knowledge graphs, most ...
research
10/27/2021

MIRA: Multihop Relation Prediction in Temporal Knowledge Graphs

In knowledge graph reasoning, we observe a trend to analyze temporal dat...
research
10/07/2020

TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion

Inferring missing facts in temporal knowledge graphs (TKGs) is a fundame...
research
11/15/2017

Revisiting Simple Neural Networks for Learning Representations of Knowledge Graphs

We address the problem of learning vector representations for entities a...
research
06/20/2020

Predicting Temporal Sets with Deep Neural Networks

Given a sequence of sets, where each set contains an arbitrary number of...
research
06/29/2021

Leveraging Static Models for Link Prediction in Temporal Knowledge Graphs

The inclusion of temporal scopes of facts in knowledge graph embedding (...
research
06/29/2022

ComDensE : Combined Dense Embedding of Relation-aware and Common Features for Knowledge Graph Completion

Real-world knowledge graphs (KG) are mostly incomplete. The problem of r...

Please sign up or login with your details

Forgot password? Click here to reset