Learning Sequence Encoders for Temporal Knowledge Graph Completion
Alberto García-Durán, Sebastijan Dumančić, Mathias Niepert · Conference on Empirical Methods in Natural Language Processing (EMNLP) · 2018
Research on link prediction in knowledge graphs has mainly focused on static multirelational 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 timeaware 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 .
Cited by 588 works. doi:10.18653/v1/d18-1516 Open-access PDF
Authors
References
- Adam: A Method for Stochastic Optimization
- AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison)
- Dropout: a simple way to prevent neural networks from overfitting
- Visualizing Data using t-SNE
- Translating Embeddings for Modeling Multi-relational Data
- Character-level Convolutional Networks for Text Classification
- Character-Aware Neural Language Models
- A Review of Relational Machine Learning for Knowledge Graphs
- YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia
- Handbook of logic in artificial intelligence and logic programming (vol. 1)