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
•Proceedings Article
Neural Machine Translation by Jointly Learning to Align and Translate
Dzmitry Bahdanau,Kyunghyun Cho,Yoshua Bengio +2 more
- 01 Jan 2015
TL;DR: It is conjecture that the use of a fixed-length vector is a bottleneck in improving the performance of this basic encoder-decoder architecture, and it is proposed to extend this by allowing a model to automatically (soft-)search for parts of a source sentence that are relevant to predicting a target word, without having to form these parts as a hard segment explicitly.
25.7K
•Posted Content
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
TL;DR: A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.
22.7K
•Posted Content
Neural Machine Translation by Jointly Learning to Align and Translate
TL;DR: In this paper, the authors propose to use a soft-searching model to find the parts of a source sentence that are relevant to predicting a target word, without having to form these parts as a hard segment explicitly.
20.9K
•Proceedings Article
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
- 09 Sep 2016
TL;DR: In this paper, a scalable approach for semi-supervised learning on graph-structured data is presented based on an efficient variant of convolutional neural networks which operate directly on graphs.
•Posted Content
Inductive Representation Learning on Large Graphs
TL;DR: GraphSAGE is presented, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data and outperforms strong baselines on three inductive node-classification benchmarks.
11.9K