3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in temporal-knowledge-graph-completion-3
No benchmarks available.
Use these libraries to find temporal-knowledge-graph-completion-3 models and implementations
No datasets available.
No subtasks available.
This work utilizes recurrent neural networks to learn time-aware representations of relation types which can be used in conjunction with existing latent factorization methods to incorporate temporal information.
Novel models for temporal KG completion are built through equipping static models with a diachronic entity embedding function which provides the characteristics of entities at any point in time where only static entity features are provided.
This paper presents TIMEPLEX, a novel time-aware KBC method, that also automatically exploits the recurrent nature of some relations and temporal interactions between pairs of relations, and achieves state-of-the-art performance on both prediction tasks.
The Temporal Message Passing (TeMP) framework is proposed, which combines graph neural networks, temporal dynamics models, data imputation and frequency-based gating techniques to address the temporal sparsity and variability of entity distributions in TKGs.
Dy- ERNIE is proposed, a non-Euclidean embedding approach that learns evolving entity representations in a product of Riemannian manifolds, where the composed spaces are estimated from the sectional curvatures of underlying data.
A new tensor decomposition model for temporal knowledge graphs completion inspired by the Tucker decomposition of order 4 tensor is built and it is demonstrated that the model outperforms baselines with an explicit margin on link prediction task.
The Time-aware Incremental Embedding (TIE) framework is presented, which combines TKG representation learning, experience replay, and temporal regularization, and introduces a set of metrics that characterizes the intransigence of the model and proposes a constraint that associates the deleted facts with negative labels.
A novel time-aware knowledge graph embebdding approach, TeLM, which performs 4th-order tensor factorization of a Temporal knowledge graph using a Linear temporal regularizer and Multivector embeddings and investigates the effect of the temporal dataset’s time granularity on temporal knowledge graph completion.
This paper proposes BoxTE, a box embedding model for TKGC, building on the static knowledge graph embeddingmodel BoxE, and shows that BoxTE is fully expressive, and possesses strong inductive capacity in the temporal setting.
A cycle-aware time-encoding scheme for time features, which is model-agnostic and offers a more generalized representation of time, is proposed and implemented in a unified temporal knowledge graph embedding framework.
Adding a benchmark result helps the community track progress.