Learning Joint Structural and Temporal Contextualized Knowledge Embeddings for Temporal Knowledge Graph Completion (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods that incorporate time information into static knowledge graph embedding ignore the contextual nature of the TKG structure. |
| Approach: | They propose a method that employs pre-trained language models to learn joint Structural and Temporal Contextualized Knowledge Embeddings. |
| Outcome: | The proposed method is superior to existing methods that ignore the contextual nature of the TKG structure. |
Similar Papers
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. |
TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for static knowledge graphs do not explicitly leverage multi-hop structural information and temporal facts from recent time steps to enhance their predictions. |
| Approach: | They propose a framework to leverage time-dependent temporal information to infer missing facts in temporal knowledge graphs. |
| Outcome: | The proposed framework achieves 10.7% improvement in Hits@10 across three standard benchmarks. |
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. |
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. |
Re-Temp: Relation-Aware Temporal Representation Learning for Temporal Knowledge Graph Completion (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models ignore ability to skip irrelevant snapshots according to entity-related relations in query . TKGC is difficult and even large-scale pre-trained language models such as gist ignore explicit temporal information. |
| Approach: | They propose a model that leverages explicit temporal embedding as input to skip unnecessary information for prediction. |
| Outcome: | The proposed model outperforms all state-of-the-art models on six datasets . it incorporates skip information flow after each timestamp to skip unnecessary information . |
Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion (2024.acl-long)
Copied to clipboard
Rui Ying, Mengting Hu, Jianfeng Wu, Yalan Xie, Xiaoyi Liu, Zhunheng Wang, Ming Jiang, Hang Gao, Linlin Zhang, Renhong Cheng
| Challenge: | Current methods embed factual knowledge into continuous vector space and apply geometric operations to learn potential patterns in temporal knowledge graphs. |
| Approach: | They propose a temporal knowledge graph completion method that uses two geometric operations to learn missing facts in temporal graphs. |
| Outcome: | The proposed method significantly outperforms existing temporal knowledge graph embedding models. |
TeRDy: Temporal Relation Dynamics through Frequency Decomposition for Temporal Knowledge Graph Completion (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for temporal knowledge graph completion struggle to capture long-term changes and short-term variability of relations. |
| Approach: | They propose a method that captures temporal relational dynamics by time-invariant embeddings and time-outvariant time-variant embeddedding. |
| Outcome: | The proposed method outperforms state-of-the-art methods on benchmark datasets. |
Learning Latent Relations for Temporal Knowledge Graph Reasoning (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for Temporal Knowledge Graph reasoning capture intra- and inter-time latent relations between entities that appear at different times. |
| Approach: | They propose a Latent relations Learning method for TKG reasoning that captures latent relations between entities at different times. |
| Outcome: | The proposed method exploits the intra- and inter-time latent relations of entities at different times. |
Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing TKBC models heavily overestimate link prediction performance due to imperfect evaluation mechanisms. |
| Approach: | They propose a method that integrates entities, relations and time into a uniform space . they propose improved evaluation protocols for link and time prediction . |
| Outcome: | The proposed method exploits the recurrent nature of some facts/events and temporal interactions between pairs of relations yielding state-of-the-art results. |
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. |