Efficiently Embedding Dynamic Knowledge Graphs
Tianxing Wu, Arijit Khan, Melvin Yong, Guilin Qi, Meng Wang

TL;DR
This paper introduces DKGE, a novel online embedding method for dynamic knowledge graphs that efficiently updates embeddings in response to graph changes, supporting real-time applications.
Contribution
The paper presents DKGE, a context-aware online embedding approach using attentive graph convolutional networks and a gating strategy for dynamic KGs, enabling rapid updates without full retraining.
Findings
DKGE outperforms static models in dynamic environments.
It achieves faster update times with comparable accuracy.
Effective in link prediction and question answering tasks.
Abstract
Knowledge graph (KG) embedding encodes the entities and relations from a KG into low-dimensional vector spaces to support various applications such as KG completion, question answering, and recommender systems. In real world, knowledge graphs (KGs) are dynamic and evolve over time with addition or deletion of triples. However, most existing models focus on embedding static KGs while neglecting dynamics. To adapt to the changes in a KG, these models need to be retrained on the whole KG with a high time cost. In this paper, to tackle the aforementioned problem, we propose a new context-aware Dynamic Knowledge Graph Embedding (DKGE) method which supports the embedding learning in an online fashion. DKGE introduces two different representations (i.e., knowledge embedding and contextual element embedding) for each entity and each relation, in the joint modeling of entities and relations as…
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.
