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
Knowledge Graph Embedding: A Survey of Approaches and Applications
TL;DR: This article provides a systematic review of existing techniques of Knowledge graph embedding, including not only the state-of-the-arts but also those with latest trends, based on the type of information used in the embedding task.
2.8K
•Posted Content
Complex Embeddings for Simple Link Prediction
TL;DR: In this article, the authors make use of complex valued embeddings to handle a large variety of binary relations, among them symmetric and antisymmetric relations, and their approach is scalable to large datasets as it remains linear in both space and time.
2.5K
•Posted Content
Spectral Networks and Locally Connected Networks on Graphs
Abstract: Convolutional Neural Networks are extremely efficient architectures in image and audio recognition tasks, thanks to their ability to exploit the local translational invariance of signal classes over their domain. In this paper we consider possible generalizations of CNNs to signals defined on more general domains without the action of a translation group. In particular, we propose two constructions, one based upon a hierarchical clustering of the domain, and another based on the spectrum of the graph Laplacian. We show through experiments that for low-dimensional graphs it is possible to learn convolutional layers with a number of parameters independent of the input size, resulting in efficient deep architectures.
2.4K
•Proceedings Article
A Three-Way Model for Collective Learning on Multi-Relational Data
Maximilian Nickel,Volker Tresp,Hans-Peter Kriegel +2 more
- 28 Jun 2011
TL;DR: This work presents a novel approach to relational learning based on the factorization of a three-way tensor that is able to perform collective learning via the latent components of the model and provide an efficient algorithm to compute the factorizations.
Knowledge Graph Embedding via Dynamic Mapping Matrix
Guoliang Ji,Shizhu He,Liheng Xu,Kang Liu,Jun Zhao +4 more
- 01 Jul 2015
TL;DR: A more fine-grained model named TransD, which is an improvement of TransR/CTransR, which not only considers the diversity of relations, but also entities, which makes it can be applied on large scale graphs.