ECOLA: Enhancing Temporal Knowledge Embeddings with Contextualized Language Representations (2023.findings-acl)
Copied to clipboard
Zhen Han, Ruotong Liao, Jindong Gu, Yao Zhang, Zifeng Ding, Yujia Gu, Heinz Koeppl, Hinrich Schütze, Volker Tresp
| Challenge: | Existing enhancement approaches cannot be applied to temporal knowledge graphs (tKGs) existing enhancement approaches assume knowledge embedding is time-independent, whereas entity embedded in tKG models evolves . |
| Approach: | They propose to use textual data to enhance temporal knowledge embedding by Enhanced Temporal Knowledge Embeddings with Contextualized Language Representations (ECOLA) to evaluate ECOLA, they introduce three new datasets for training and evaluation. |
| Outcome: | The proposed model significantly improves Hits@1 on the link prediction task. |
Similar Papers
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. |
EventKE: Event-Enhanced Knowledge Graph Embedding (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Experimental results show that events can greatly improve the quality of KG embeddings on multiple downstream tasks. |
| Approach: | They propose an event-enhanced KG embedding model that incorporates events into KGs . they first incorporate event nodes by building a heterogeneous network with event argument links . |
| Outcome: | The proposed model incorporates event nodes into the original knowledge graphs . it can be used to fuse event information into the KG embeddings on multiple tasks . |
GenTKG: Generative Forecasting on Temporal Knowledge Graph with Large Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for temporal relational forecasting are limited and require limited training data. |
| Approach: | They propose a retrieval-augmented generation framework that uses temporal logical rule-based retrieval and parameter-efficient instruction tuning to solve temporal knowledge forecasting challenges. |
| Outcome: | The proposed framework outperforms conventional methods in the temporal knowledge graph domain with low computation resources. |
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. |
TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotation (2020.coling-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs that contain time information for entities and relations have been used for learning and inference. |
| Approach: | They propose a temporal evolution of entity embedding that defines the temporal rotation from the initial time to the current time in the complex vector space. |
| Outcome: | The proposed model outperforms existing state-of-the-art models for link prediction on three different TKGs. |
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. |
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. |
HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding (D18-1)
Copied to clipboard
| Challenge: | Existing KG embedding methods ignore this temporal dimension while learning embedds of the KG elements. |
| Approach: | They propose a temporally aware KG embedding method which incorporates time in the entity-relation space by associating each timestamp with a corresponding hyperplane. |
| Outcome: | The proposed method performs KG inference using temporal guidance and predicts scopes for relational facts with missing time annotations. |
Contextual String Embeddings for Sequence Labeling (C18-1)
Copied to clipboard
| Challenge: | Recent advances in language modeling have made it viable to model language as distributions over characters. |
| Approach: | They propose to leverage internal states of a trained character language model to produce a new type of word embeddings. |
| Outcome: | The proposed embeddings outperform the state-of-the-art on four classic sequence labeling tasks. |
Arbitrary Time Information Modeling via Polynomial Approximation for Temporal Knowledge Graph Embedding (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs lack rich inference patterns and the limited ability to model arbitrary timestamps continuously. |
| Approach: | They propose a temporal knowledge graph-based temporal representation method that decomposes time information by polynomials and then enhances the model's capability to represent arbitrary timestamps flexibly. |
| Outcome: | The proposed method can encode arbitrary time information or even unseen timestamps while capturing rich inference patterns and higher-arity relations of the knowledge base. |