Tucker decomposition-based Temporal Knowledge Graph Completion
Knowledge graphs have been demonstrated to be an effective tool for numerous intelligent applications. However, a large amount of valuable knowledge still exists implicitly in the knowledge graphs. To enrich the existing knowledge graphs, recent years witness that many algorithms for link prediction and knowledge graphs embedding have been designed to infer new facts. But most of these studies focus on the static knowledge graphs and ignore the temporal information that reflects the validity of knowledge. Developing the model for temporal knowledge graphs completion is an increasingly important task. In this paper, we build a new tensor decomposition model for temporal knowledge graphs completion inspired by the Tucker decomposition of order 4 tensor. We demonstrate that the proposed model is fully expressive and report state-of-the-art results for several public benchmarks. Additionally, we present several regularization schemes to improve the strategy and study their impact on the proposed model. Experimental studies on three temporal datasets (i.e. ICEWS2014, ICEWS2005-15, GDELT) justify our design and demonstrate that our model outperforms baselines with an explicit margin on link prediction task.
Code (1)
Tasks
Knowledge Graph CompletionKnowledge GraphsLink PredictionTemporal Knowledge Graph CompletionTensor DecompositionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
TuckER: Tensor Factorization for Knowledge Graph Completion
Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is the task of inferring missing facts based on existing one…
Knowledge Graph CompletionKnowledge GraphsLink PredictionMulti-Task Learning+1TuckER: Tensor Factorization for Knowledge Graph Completion
Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones.…
Knowledge Graph CompletionKnowledge GraphsLink PredictionPredictionProjected Canonical Decomposition for Knowledge Base Completion
The leading approaches to tensor completion and link prediction are based on the canonical polyadic (CP) decomposition of tensors. While these approaches were originally motivated by low rank approximations, the best per…
Knowledge Base CompletionLink PredictionKnowledge Graph Completion with Mixed Geometry Tensor Factorization
In this paper, we propose a new geometric approach for knowledge graph completion via low rank tensor approximation. We augment a pretrained and well-established Euclidean model based on a Tucker tensor decomposition wit…
Knowledge Graph CompletionKnowledge GraphsLink PredictionTensor Decomposition+1Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion
Tensor completion refers to the task of estimating the missing data from an incomplete measurement or observation, which is a core problem frequently arising from the areas of big data analysis, computer vision, and netw…
Data CompressionFace Recognition