Open AccessPosted Content
Temporal Knowledge Graph Completion using Box Embeddings.
TL;DR: In this article, the authors propose a box embedding model for temporal knowledge graph completion (TKGC), where each fact is additionally associated with a time stamp and the idea is to learn latent representations for entities, relations, and timestamps and then use the learned representations to predict missing facts at various time steps.
read more
Abstract: Knowledge graph completion is the task of inferring missing facts based on existing data in a knowledge graph. Temporal knowledge graph completion (TKGC) is an extension of this task to temporal knowledge graphs, where each fact is additionally associated with a time stamp. Current approaches for TKGC primarily build on existing embedding models which are developed for (static) knowledge graph completion, and extend these models to incorporate time, where the idea is to learn latent representations for entities, relations, and timestamps and then use the learned representations to predict missing facts at various time steps. In this paper, we propose BoxTE, a box embedding model for TKGC, building on the static knowledge graph embedding model BoxE. We show that BoxTE is fully expressive, and possesses strong inductive capacity in the temporal setting. We then empirically evaluate our model and show that it achieves state-of-the-art results on several TKGC benchmarks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Knowledge Graphs: Opportunities and Challenges
TL;DR: In this paper , the authors present a systematic overview of knowledge graph research and discuss severe technical challenges in this field, such as knowledge graph embeddings, knowledge acquisition, knowledge graph completion, knowledge fusion, and knowledge reasoning.
215
•Posted Content
Temporal Knowledge Graph Completion using Box Embeddings.
TL;DR: In this article, the authors propose a box embedding model for temporal knowledge graph completion (TKGC), where each fact is additionally associated with a time stamp and the idea is to learn latent representations for entities, relations, and timestamps and then use the learned representations to predict missing facts at various time steps.
57
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Ke Liang,Lingyuan Meng,Meng Li,Yue Liu,Wenxuan Tu,Siwei Wang,Sihang Zhou,Xinwang Liu,Fuchun Sun,Kunlun He +9 more
Along the Time
17 Oct 2022
TL;DR: Zhang et al. as discussed by the authors proposed a TimeLine-Traced Knowledge Graph Embedding method (TLT-KGE) for temporal knowledge graph completion, which can not only distinguish the independence of the semantic and temporal information, but also establish a connection between them.
EventKGE: Event knowledge graph embedding with event causal transfer
TL;DR: This paper proposes EventKGE, a novel knowledge graph embedding model that incorporates event causal transfer to effectively learn entity representations by integrating event information into traditional KGE models for improved downstream task performance.
10
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
•Posted Content
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
TL;DR: In this article, the adaptive estimates of lower-order moments are used for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimate of lowerorder moments.
82.5K
•Proceedings Article
Translating Embeddings for Modeling Multi-relational Data
Antoine Bordes,Nicolas Usunier,Alberto Garcia-Duran,Jason Weston,Oksana Yakhnenko +4 more
- 05 Dec 2013
TL;DR: TransE is proposed, a method which models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities, which proves to be powerful since extensive experiments show that TransE significantly outperforms state-of-the-art methods in link prediction on two knowledge bases.
Modeling Relational Data with Graph Convolutional Networks
Michael Sejr Schlichtkrull,Thomas Kipf,Peter Bloem,Rianne van den Berg,Ivan Titov,Ivan Titov,Max Welling,Max Welling +7 more
- 03 Jun 2018
TL;DR: It is shown that factorization models for link prediction such as DistMult can be significantly improved through the use of an R-GCN encoder model to accumulate evidence over multiple inference steps in the graph, demonstrating a large improvement of 29.8% on FB15k-237 over a decoder-only baseline.
Yago: a core of semantic knowledge
Fabian M. Suchanek,Gjergji Kasneci,Gerhard Weikum +2 more
- 08 May 2007
TL;DR: YAGO as discussed by the authors is a light-weight and extensible ontology with high coverage and quality, which includes the Is-A hierarchy as well as non-taxonomic relations between entities (such as HASONEPRIZE).