Temporal Knowledge Graph Completion: A Survey
- URL: http://arxiv.org/abs/2201.08236v1
- Date: Sun, 16 Jan 2022 05:43:49 GMT
- Title: Temporal Knowledge Graph Completion: A Survey
- Authors: Borui Cai, Yong Xiang, Longxiang Gao, He Zhang, Yunfeng Li, Jianxin Li
- Abstract summary: Knowledge graph completion (KGC) can predict missing links and is crucial for real-world knowledge graphs.
Recent methods have shown improved predictive results by further incorporating the timestamps of facts.
- Score: 24.35073672695095
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Knowledge graph completion (KGC) can predict missing links and is crucial for
real-world knowledge graphs, which widely suffer from incompleteness. KGC
methods assume a knowledge graph is static, but that may lead to inaccurate
prediction results because many facts in the knowledge graphs change over time.
Recently, emerging methods have shown improved predictive results by further
incorporating the timestamps of facts; namely, temporal knowledge graph
completion (TKGC). With this temporal information, TKGC methods can learn the
dynamic evolution of the knowledge graph that KGC methods fail to capture. In
this paper, for the first time, we summarize the recent advances in TKGC
research. First, we detail the background of TKGC, including the problem
definition, benchmark datasets, and evaluation metrics. Then, we summarize
existing TKGC methods based on how timestamps of facts are used to capture the
temporal dynamics. Finally, we conclude the paper and present future research
directions of TKGC.
Related papers
- GC-Bench: An Open and Unified Benchmark for Graph Condensation [54.70801435138878]
We develop a comprehensive Graph Condensation Benchmark (GC-Bench) to analyze the performance of graph condensation.
GC-Bench systematically investigates the characteristics of graph condensation in terms of the following dimensions: effectiveness, transferability, and complexity.
We have developed an easy-to-use library for training and evaluating different GC methods to facilitate reproducible research.
arXiv Detail & Related papers (2024-06-30T07:47:34Z) - History repeats Itself: A Baseline for Temporal Knowledge Graph Forecasting [10.396081172890025]
Temporal Knowledge Graph (TKG) Forecasting aims at predicting links in Knowledge Graphs for future timesteps based on a history of Knowledge Graphs.
We propose to design an intuitive baseline for TKG Forecasting based on predicting recurring facts.
arXiv Detail & Related papers (2024-04-25T16:39:32Z) - Counterfactual Reasoning with Knowledge Graph Embeddings [3.6311338398148534]
Knowledge graph embeddings (KGEs) were originally developed to infer true but missing facts in incomplete knowledge repositories.
In this paper, we link knowledge graph completion and counterfactual reasoning via our new task CFKGR.
arXiv Detail & Related papers (2024-03-11T17:21:39Z) - Continual Learning on Graphs: Challenges, Solutions, and Opportunities [72.7886669278433]
We provide a comprehensive review of existing continual graph learning (CGL) algorithms.
We compare methods with traditional continual learning techniques and analyze the applicability of the traditional continual learning techniques to forgetting tasks.
We will maintain an up-to-date repository featuring a comprehensive list of accessible algorithms.
arXiv Detail & Related papers (2024-02-18T12:24:45Z) - PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation [49.00940417190911]
Existing graph representation learning models encounter a catastrophic problem when learning with newly incoming graphs.
In this paper, we propose a PUdo-label guided Memory bAnkrogation (PUMA) framework to enhance its efficiency and effectiveness.
arXiv Detail & Related papers (2023-12-22T05:09:58Z) - From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited [51.24526202984846]
Graph-based semi-supervised learning (GSSL) has long been a hot research topic.
graph convolutional networks (GCNs) have become the predominant techniques for their promising performance.
arXiv Detail & Related papers (2023-09-24T10:10:21Z) - A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and
Prospects [73.44022660932087]
temporal characteristics are prominently evident in a substantial volume of knowledge.
The continuous emergence of new knowledge, the weakness of the algorithm for extracting structured information from unstructured data, and the lack of information in the source dataset are cited.
The task of Temporal Knowledge Graph Completion (TKGC) has attracted increasing attention, aiming to predict missing items based on the available information.
arXiv Detail & Related papers (2023-08-04T16:49:54Z) - A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic,
and Multimodal [57.8455911689554]
Knowledge graph reasoning (KGR) aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs)
It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc.
arXiv Detail & Related papers (2022-12-12T08:40:04Z) - Temporal Knowledge Graph Completion using Box Embeddings [13.858051019755283]
BoxTE is a box embedding model for temporal knowledge graph completion.
We show that BoxTE is fully expressive, and possesses strong inductive capacity in the temporal setting.
We then empirically evaluate our model and show that it achieves state-of-the-art results on several TKGC benchmarks.
arXiv Detail & Related papers (2021-09-18T17:12:13Z) - A Temporal Knowledge Graph Completion Method Based on Balanced Timestamp
Distribution [1.3071779090051663]
A temporal knowledge graph completion (KGC) method is proposed based on the direct encoding time information framework.
A large number of experiments on temporal knowledge graph datasets extracted from the real world demonstrate the effectiveness of our method.
arXiv Detail & Related papers (2021-08-30T07:27:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.