IEEE International Conference on Big Data

Inferring Relations in Knowledge Graphs with Tensor Decompositions

Ankur Padia, Kostantinos Kalpakis, and Tim Finin

December 5, 2016

Multi-relational data, like knowledge graphs, are generated from multiple data sources by extracting entities and their relationships. We often want to include inferred, implicit or likely relationships that are not explicitly stated, which can be viewed as link-prediction in a graph. Tensor decomposition models have been shown to produce state-of-the-art results in link-prediction tasks. We describe a simple but novel extension to an existing tensor decomposition model to predict missing links using similarity among tensor slices, as opposed to an existing tensor decomposition models which assumes each slice to contribute equally in predicting links. Our extended model performs better than the original tensor decomposition and the non-negative tensor decomposition variant of it in an evaluation on several datasets.

BibTeX OWL Tweet Scholar

Tags: inference, knowledge graph, learning, link prediction, multi-relational data, tensor

Type: InProceedings

Publisher: IEEE

Downloads: 1585 downloads