paper-with-me

홈 › Papers

TuckER: Tensor Factorization for Knowledge Graph Completion

2019-05-16 · ICML Workshop AMTL 2019 6 · Anonymous

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 ones. We propose TuckER, a relatively simple yet powerful linear model based on Tucker decomposition of the binary tensor representation of knowledge graph triples. By using this particular decomposition, parameters are shared between relations, enabling multi-task learning. TuckER outperforms previous state-of-the-art models across several standard link prediction datasets.

📄 PDF Abstract BibTeX

Code (1)

ibalazevic/TuckER 공식 구현 pytorch

Tasks

Knowledge Graph CompletionKnowledge GraphsLink PredictionMulti-Task LearningPrediction

Similar Papers 제목 키워드 기반

TuckER: Tensor Factorization for Knowledge Graph Completion

2019-01-28 · IJCNLP 2019 11 · Ivana Balažević, Carl Allen, Timothy M. Hospedales

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 PredictionPrediction

Knowledge Graph Completion with Mixed Geometry Tensor Factorization

2025-04-03 · Viacheslav Yusupov, Maxim Rakhuba, Evgeny Frolov

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+1

Projected Canonical Decomposition for Knowledge Base Completion

2019-09-25 · Timothée Lacroix, Guillaume Obozinski, Joan Bruna, Nicolas Usunier

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 Prediction

Implicit Regularization in Deep Tensor Factorization

2021-05-04 · Paolo Milanesi, Hachem Kadri, Stéphane Ayache, Thierry Artières

Attempts of studying implicit regularization associated to gradient descent (GD) have identified matrix completion as a suitable test-bed. Late findings suggest that this phenomenon cannot be phrased as a minimization-no…

Matrix Completion

NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion

2021-04-15 · Shashank Sonkar, Arzoo Katiyar, Richard G. Baraniuk

Knowledge graphs link entities through relations to provide a structured representation of real world facts. However, they are often incomplete, because they are based on only a small fraction of all plausible facts. The…

Knowledge Graph CompletionKnowledge GraphsLink PredictionPrediction