REVIEW 2 cited by
TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion
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
Signed reviews
read the original abstract
Inferring missing facts in temporal knowledge graphs (TKGs) is a fundamental and challenging task. Previous works have approached this problem by augmenting methods for static knowledge graphs to leverage time-dependent representations. However, these methods do not explicitly leverage multi-hop structural information and temporal facts from recent time steps to enhance their predictions. Additionally, prior work does not explicitly address the temporal sparsity and variability of entity distributions in TKGs. We propose the Temporal Message Passing (TeMP) framework to address these challenges by combining graph neural networks, temporal dynamics models, data imputation and frequency-based gating techniques. Experiments on standard TKG tasks show that our approach provides substantial gains compared to the previous state of the art, achieving a 10.7% average relative improvement in Hits@10 across three standard benchmarks. Our analysis also reveals important sources of variability both within and across TKG datasets, and we introduce several simple but strong baselines that outperform the prior state of the art in certain settings.
Forward citations
Cited by 2 Pith papers
-
VITA: Versatile Time Representation Learning for Temporal Hyper-Relational Knowledge Graphs
VITA uses a (conjunction, start, end) time triplet and an encoder-decoder Transformer to predict missing entities, relations, times, and numeric literals in temporal hyper-relational knowledge graphs, outperforming ba...
-
Towards Improving Long-Tail Entity Predictions in Temporal Knowledge Graphs through Global Similarity and Weighted Sampling
A global relation-similarity enhancement layer plus frequency-weighted sampling improves long-tail entity link prediction in incrementally trained temporal knowledge graphs on the ICEWS14 and ICEWS18 benchmarks.
Discussion (0). Continue with ORCID to comment.