Knowledge Graph Completion via Complex Tensor Factorization

zbMath1435.68323arXiv1702.06879MaRDI QIDQ4637058

Johannes Welbl, G. Bouchard, Sebastian Riedel, Théo Trouillon, Christopher R. Dance, Eric Gaussier

Publication date: 17 April 2018

Full work available at URL: https://arxiv.org/abs/1702.06879

zbMATH Keywords

matrix completionstatistical relational learningcomplex embeddingstensor factorizationknowledge graph

Mathematics Subject Classification ID

Knowledge representation (68T30) Matrix completion problems (15A83)

Related Items (1)

Non-parametric learning of embeddings for relational data using Gaifman locality theorem

Uses Software

• Theano
• SciPy
• AdaGrad
• Freebase
• DBpedia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity measures of sign matrices
• A semantic matching energy function for learning with multi-relational data
• Markov logic networks
• Combining Two and Three-Way Embedding Models for Link Prediction in Knowledge Bases
• Statistical Relational Artificial Intelligence: Logic, Probability, and Computation
• Matrix Analysis
• A prewhitening-induced bound on the identification error in independent component analysis
• Sign rank versus Vapnik-Chervonenkis dimension

This page was built for publication: Knowledge Graph Completion via Complex Tensor Factorization