Open AccessPosted Content
Efficiently Embedding Dynamic Knowledge Graphs
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
Figures

Table 4: Evaluation results of QA using DKGE 
Table 1: Details of our datasets. 
Figure 5: The AGCN model. The input is initial vertex features and adjacency information of the given subgraph. Hidden layers conduct convolutional operations to generate new vertex features. The attention layer computes the weight of each vertex. The output contextual subgraph embedding is the weighted sum of all vertices’ features. 
Figure 7: The comparison results on efficiency. 
Figure 8: The robustness analysis for repeated online learning. ![Figure 1: (a) A KG G does not have the relation r1 between entities e1 and e2 at time step T , and we add a triple (e1, r1, e2) at time step T + 1. (b) An illustration of using puTransE [31] on G.](/figures/figure1-1-4mpag6wo0sk5.png)
Figure 1: (a) A KG G does not have the relation r1 between entities e1 and e2 at time step T , and we add a triple (e1, r1, e2) at time step T + 1. (b) An illustration of using puTransE [31] on G.
Citations
Temporal Knowledge Graph Reasoning Based on Evolutional Representation Learning
Zixuan Li,Xiaolong Jin,Wei Li,Saiping Guan,Jiafeng Guo,Huawei Shen,Yuanzhuo Wang,Xueqi Cheng +7 more
- 11 Jul 2021
TL;DR: In this paper, a recurrent evolution network based on Graph Convolutional Network (GCN) is proposed to capture the structural dependencies within the KG at each timestamp, which learns the evolutional representations of entities and relations by modeling the kG sequence recurrently.
A Survey on Embedding Dynamic Graphs
TL;DR: In this paper, the authors propose to embed static graphs in low-dimensional vector spaces, which plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization.
Search from History and Reason for Future: Two-stage Reasoning on Temporal Knowledge Graphs
Zixuan Li,Xiaolong Jin,Saiping Guan,Wei Li,Jiafeng Guo,Yuanzhuo Wang,Xueqi Cheng +6 more
- 01 Aug 2021
TL;DR: Zhang et al. as mentioned in this paper proposed CluSTeR to predict future facts in a two-stage manner, clue searching and temporal reasoning, where the beam search policy via reinforcement learning (RL) was used to induce multiple clues from historical facts.
Peer Review
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal
Kenny Ye Liang,Lingyuan Meng,Meng Liu,Yue Li,Wenxuan Tu,Siwen Wang,Sihang Zhou,Xinwang Liu,Fu Sun +8 more
- 12 Dec 2022
TL;DR: Knowledge graph reasoning (KG) as discussed by the authors aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs), which has become a fast-growing research direction.
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
References
HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding.
Shib Sankar Dasgupta,Swayambhu Nath Ray,Partha Pratim Talukdar +2 more
- 01 Jan 2018
TL;DR: HyTE is a temporally aware KG embedding method which explicitly incorporates time in the entity-relation space by associating each timestamp with a corresponding hyperplane and not only performs KG inference using temporal guidance, but also predicts temporal scopes for relational facts with missing time annotations.
•Proceedings Article
DyRep: Learning Representations over Dynamic Graphs
Rakshit Trivedi,Mehrdad Farajtabar,Prasenjeet Biswal,Hongyuan Zha +3 more
- 01 May 2019
TL;DR: DyRep as mentioned in this paper proposes a two-time scale deep temporal point process model that captures the interleaved dynamics of the observed processes, which is further parameterized by a temporal-attentive representation network that encodes temporally evolving structural information into node representations.
OpenKE: An Open Toolkit for Knowledge Embedding
Xu Han,Shulin Cao,Xin Lv,Yankai Lin,Zhiyuan Liu,Maosong Sun,Juanzi Li +6 more
- 01 Nov 2018
TL;DR: An open toolkit for knowledge embedding, which provides a unified framework and various fundamental models to embed knowledge graphs into a continuous low-dimensional space and the embeddings of some existing large-scale knowledge graphs pre-trained by OpenKE are available.
Knowledge Graph Completion with Adaptive Sparse Transfer Matrix
Guoliang Ji,Kang Liu,Shizhu He,Jun Zhao +3 more
TL;DR: TranSparse is a novel approach for knowledge graph completion that deals with heterogeneity and imbalance by using adaptive sparse transfer matrices. It outperforms Trans(E, H, R, and D) significantly and achieves state-of-the-art performance.
Diachronic Embedding for Temporal Knowledge Graph Completion
Rishab Goel,Seyed Mehran Kazemi,Marcus A. Brubaker,Pascal Poupart +3 more
- 03 Apr 2020
TL;DR: Novel models for temporal KG completion are built through equipping static models with a diachronic entity embedding function which provides the characteristics of entities at any point in time where only static entity features are provided.