Embedding Models for Episodic Knowledge Graphs
Yunpu Ma, Volker Tresp, Erik Daxberger

TL;DR
This paper extends static knowledge graph embedding models to temporal knowledge graphs, introducing a new tensor model called ConT, and demonstrates improved performance on real-world datasets, with implications for modeling episodic and semantic memory.
Contribution
The paper generalizes existing static knowledge graph models to temporal graphs and introduces ConT, a novel tensor model with superior generalization capabilities.
Findings
ConT outperforms existing models on GDELT and ICEWS datasets.
Temporal embeddings can model episodic memory effectively.
Episodic-to-semantic memory projection is validated on ICEWS.
Abstract
In recent years a number of large-scale triple-oriented knowledge graphs have been generated and various models have been proposed to perform learning in those graphs. Most knowledge graphs are static and reflect the world in its current state. In reality, of course, the state of the world is changing: a healthy person becomes diagnosed with a disease and a new president is inaugurated. In this paper, we extend models for static knowledge graphs to temporal knowledge graphs. This enables us to store episodic data and to generalize to new facts (inductive learning). We generalize leading learning models for static knowledge graphs (i.e., Tucker, RESCAL, HolE, ComplEx, DistMult) to temporal knowledge graphs. In particular, we introduce a new tensor model, ConT, with superior generalization performance. The performances of all proposed models are analyzed on two different datasets: the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Advanced Graph Neural Networks · Data Quality and Management
MethodsRESCAL
