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
NeMa: fast graph search with label similarity
Arijit Khan,Yinghui Wu,Charu C. Aggarwal,Xifeng Yan +3 more
- 01 Jan 2013
TL;DR: This paper proposes NeMa (Network Match), a neighborhood-based sub graph matching technique for querying real-life networks and proposes a novel subgraph matching cost metric that aggregates the costs of matching individual nodes, and unifies both structure and node label similarities.
•Proceedings Article
Towards Time-Aware Knowledge Graph Completion
Tingsong Jiang,Tianyu Liu,Tao Ge,Lei Sha,Baobao Chang,Sujian Li,Zhifang Sui +6 more
- 01 Dec 2016
TL;DR: A novel time-aware knowledge graph completion model that is able to predict links in a KG using both the existing facts and the temporal information of the facts and achieves the state-of-the-art on temporal facts consistently.