Hyperbolic Temporal Knowledge Graph Embeddings with Relational and Time Curvatures (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge Graph models for Link Prediction are insensitive to time. |
| Approach: | They propose a time-aware extension of ATTH model which defines curvature of a Riemannian manifold as the product of both relation and time. |
| Outcome: | The proposed model can achieve competitive or even better performance than the state-of-the-art model on Temporal KGs, albeit its nontemporality. |
Similar Papers
DyERNIE: Dynamic Evolution of Riemannian Manifold Embeddings for Temporal Knowledge Graph Completion (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing embedding approaches for temporal knowledge graphs typically learn entity representations and their dynamic evolution in the Euclidean space. |
| Approach: | They propose a non-Euclidean embedding approach that learns evolving entity representations in a product of Riemannian manifolds. |
| Outcome: | The proposed model improves on three real-world datasets showing that the embeddings on Riemannian manifolds can capture the evolution of temporal KGs. |
Hyperbolic Graph Neural Network for Temporal Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing knowledge graph models are inefficient at capturing complex temporal dynamics and hierarchical relations within TKGs. |
| Approach: | They propose to use hyperbolic geometry to effectively model temporal knowledge graphs . they use the hyperbolical gated Graph Neural Network and the hyperbipolar convolutional neural network . |
| Outcome: | The proposed model achieves state-of-the-art performance on four benchmark datasets . it is compared with previous models and is expected to be useful in real-world applications . |
Temporal Knowledge Graph Completion with Approximated Gaussian Process Embedding (2022.coling-1)
Copied to clipboard
| Challenge: | Existing TKGC methods are based on deterministic vector embeddings, which are not flexible and expressive enough. |
| Approach: | They propose a method that maps entities and relations to multivariate Gaussian processes by mapping global trends and local fluctuations in TKGs. |
| Outcome: | The proposed method can predict global trends and local fluctuations in the TKGs and can be optimized on two real-world benchmark datasets. |
Time-dependent Entity Embedding is not All You Need: A Re-evaluation of Temporal Knowledge Graph Completion Models under a Unified Framework (2021.emnlp-main)
Copied to clipboard
| Challenge: | Various temporal knowledge graph (KG) completion models have been proposed . knowledge graphs are typically static and store facts in their current state . |
| Approach: | They propose to use temporal embeddings and a score function to model temporal knowledge graphs . they classify the temporal embedded methods into two classes: timestamp and time-dependent . |
| Outcome: | The proposed models outperform current models on ICEWS datasets with 3000 experiments and 13159 GPU hours. |
Leveraging 3D Gaussian for Temporal Knowledge Graph Embedding (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Representation learning in knowledge graphs (KGs) has focused on static data, yet many real-world knowledge graph are inherently dynamic. |
| Approach: | They propose a temporal embedding method inspired by 3D Gaussian Splatting where entities, relations, and timestamps are modeled as 3D gaussian distributions with learnable structured covariance. |
| Outcome: | The proposed method outperforms state-of-the-art methods on three benchmark TKG datasets. |
RECIPE-TKG: From Sparse History to Structured Reasoning for LLM-based Temporal Knowledge Graph Completion (2026.eacl-long)
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) represent dynamic facts as timestamped relations between entities. Large Language Models (LLMs) have sparked interest in using pretrained generative models for TKG completion. |
| Approach: | They propose a framework that allows for rule-based multi-hop sampling and contrastive fine-tuning to shape relational compatibility. |
| Outcome: | Experiments show that RECIPE-TKG outperforms prior LLM-based methods across input regimes. |
Learning Sequence Encoders for Temporal Knowledge Graph Completion (D18-1)
Copied to clipboard
| Challenge: | Existing work on link prediction in knowledge graphs has focused on static multi-relational data. |
| Approach: | They propose to learn latent entity and relation type representations to incorporate temporal information into knowledge graphs. |
| Outcome: | The proposed approach is robust to common challenges in real-world KGs. |
Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models of temporal fact reasoning do not explicitly specify temporal information for each fact. |
| Approach: | They propose a new type of data structure called hyper-relational TKG to study temporal fact reasoning over HKGs. |
| Outcome: | The proposed model is based on two new benchmark HTKG datasets . it provides additional key-value pairs (i.e., qualifiers) for each KG fact . |
zrLLM: Zero-Shot Relational Learning on Temporal Knowledge Graphs with Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing methods to forecast links on temporal knowledge graphs are embedding-based . but they face a strong challenge in modeling the unseen zero-shot relations . |
| Approach: | They propose to embed knowledge graphs (TKGF) entities and relations based on observed contexts into embedding-based methods to model unseen zero-shot relations. |
| Outcome: | The proposed methods show strong performance on traditional TKG forecasting benchmarks, but they face a strong challenge in modeling unseen zero-shot relations that have no prior graph context. |
Temporal Knowledge Graph Completion using a Linear Temporal Regularizer and Multivector Embeddings (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs involve evolving data, e.g., the fact (The President of the United States is Barack Obama) is valid only from 2009 to 2017. |
| Approach: | They propose a time-aware knowledge graph embebdding approach which performs 4th-order tensor factorization of a Temporal knowledge graph using a Linear temporal regularizer and Multivector embeddings. |
| Outcome: | The proposed model achieves state-of-the-art performance over four well-established temporal knowledge graph completion benchmarks. |