Journal of Web Semantics

Knowledge Graph Fact Prediction via Knowledge-Enriched Tensor Factorization

Ankur Padia, Kostantinos Kalpakis, Francis Ferraro, and Tim Finin

December 1, 2019

We present a family of novel methods for embedding knowledge graphs into real-valued tensors. These tensor-based embeddings capture the ordered relations that are typical in the knowledge graphs represented by semantic web languages like RDF. Unlike many previous models, our methods can easily use prior background knowledge provided by users or extracted automatically from existing knowledge graphs. In addition to providing more robust methods for knowledge graph embedding, we provide a provably-convergent, linear tensor factorization algorithm. We demonstrate the efficacy of our models for the task of predicting new facts across eight different knowledge graphs, achieving between 5% and 50% relative improvement over existing state-of-the-art knowledge graph embedding techniques. Our empirical evaluation shows that all of the tensor decomposition models perform well when the average degree of an entity in a graph is high, with constraint-based models doing better on graphs with a small number of highly similar relations and regularization-based models dominating for graphs with relations of varying degrees of similarity.

BibTeX OWL Tweet Scholar

Tags: fact prediction, knowledge graph embedding, knowledge graph, representation learning, tensor decomposition, tensor factorization

Type: Article

Publisher: Elsevier

Volume: 59

Note: https://doi.org/10.1016/j.websem.2019.01.004; submitted January 2019; data and code at https://github.com/Ebiquity/KGFP

Downloads: 1097 downloads