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
•Proceedings Article
Toward a Transparent Recommender System.
Grzegorz P. Mika
- 01 Jan 2020
TL;DR: The goal of this paper is to outline the research questions set out in the Ph.D. thesis related to the transparency and trust in a recommendation by providing an intuitive explanation and to put forward the preliminary ideas to tackle the challenges.
•Posted Content
Search from History and Reason for Future: Two-stage Reasoning on Temporal Knowledge Graphs.
TL;DR: Zhang et al. as discussed by the authors 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.
A unified Link Prediction architecture applied on a novel heterogenous Knowledge Base
David Hilman,Ovidiu Serban +1 more
TL;DR: In this article , the authors proposed a framework which is the first to provide support for latent feature model LP on heterogeneous Knowledge Bases (KBs) and used Refinitiv Knowledge Graph to produce a heterogeneous dataset with which capabilities of the framework are examined.
1
StreamE: Learning to Update Representations for Temporal Knowledge Graphs in Streaming Scenarios
Jiasheng Zhang,Jie Shao,Bin Cui +2 more
- 19 Jul 2023
TL;DR: StreamE as discussed by the authors proposes a lightweight framework called StreamE towards the efficient generation of TKG representations in streaming scenarios, where entity representations are decoupled from the model training to serve as the memory module to store the historical information of entities.
1
Neurosymbolic Methods for Dynamic Knowledge Graphs
Mehwish Alam,Genet Asefa Gesese,Pierre-Henri Paris +2 more
- 06 Sep 2024
TL;DR: This chapter introduces neurosymbolic methods for dynamic knowledge graphs, focusing on representation learning for dynamic KG completion and entity alignment tasks, and discusses challenges and future directions for dynamic KGs with or without temporal information.
1
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