REVIEW 5 cited by
A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and Prospects
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Temporal characteristics are prominently evident in a substantial volume of knowledge, which underscores the pivotal role of Temporal Knowledge Graphs (TKGs) in both academia and industry. However, TKGs often suffer from incompleteness for three main reasons: 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. Thus, the task of Temporal Knowledge Graph Completion (TKGC) has attracted increasing attention, aiming to predict missing items based on the available information. In this paper, we provide a comprehensive review of TKGC methods and their details. Specifically, this paper mainly consists of three components, namely, 1)Background, which covers the preliminaries of TKGC methods, loss functions required for training, as well as the dataset and evaluation protocol; 2)Interpolation, that estimates and predicts the missing elements or set of elements through the relevant available information. It further categorizes related TKGC methods based on how to process temporal information; 3)Extrapolation, which typically focuses on continuous TKGs and predicts future events, and then classifies all extrapolation methods based on the algorithms they utilize. We further pinpoint the challenges and discuss future research directions of TKGC.
Forward citations
Cited by 5 Pith papers
-
Time Imprint: Learning Time-Aware Representations in Multi-Modal Knowledge Graphs
Treating time as an entity-level modality with median-K timestamp selection, attention pooling, and three-stage temporal injection yields large link-prediction gains on the hardest multi-modal ambiguity cases.
-
Knowledge Restoration-driven Prompt Optimization: Unlocking LLM Potential for Open-Domain Relational Triplet Extraction
KRPO iteratively optimizes LLM prompts via NLI feedback on triplet-restored sentences and canonicalizes relations with a dynamic memory, reporting higher F1 than EDC on WebNLG, REBEL, and Wiki-NRE.
-
CAGE: Cognitive Attribution Graphs for Faithful Inline Citation Generation in Long-Form Question Answering
Explicit cognitive attribution graphs before generation contract claim–document assignment space and yield SOTA faithful inline citations on long-form QA benchmarks.
-
A Multi-Expert Structural-Semantic Hybrid Framework for Unveiling Historical Patterns in Temporal Knowledge Graphs
MESH integrates a GCN-based structural encoder with a frozen LLM-based semantic encoder via gated expert modules that adapt to historical and non-historical events, achieving modest gains on ICEWS14 and ICEWS18.
-
Rethinking Regularization Methods for Knowledge Graph Completion
A selective sparsity regularizer, SPR, nudges link prediction metrics up on standard benchmarks, but the evidence is single-run and the theoretical justification is mathematically flawed.
Discussion (0). Sign in to comment.