Inferring Relations in Knowledge Graphs with Tensor Decompositions
Loading...
Links to Files
Permanent Link
Author/Creator
Author/Creator ORCID
Date
2017-02-06
Type of Work
Department
Program
Citation of Original Publication
Ankur Padia, Kostantinos Kalpakis, Tim Finin, Inferring Relations in Knowledge Graphs with Tensor Decompositions,IEEE International Conference on Big Data December 5,2016, DOI: 10.1109/BigData.2016.7841096
Rights
This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
© 2017 IEEE
© 2017 IEEE
Abstract
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.