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. |
Similar Papers
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 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. |
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. |
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. |
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 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 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. |
Compounding Geometric Operations for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) is one of the most fundamental problems in AI research. |
| Approach: | They propose a new knowledge graph embedding model by leveraging translation, rotation, and scaling operations to form a composite one. |
| Outcome: | The proposed model outperforms existing models on three KG prediction tasks. |
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 . |
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. |