Joint Matrix-Tensor Factorization for Knowledge Base Inference

Prachi Jain, Shikhar Murty, Mausam, Soumen Chakrabarti
6/2/2017
cs.AI

Official code: dair-iitd/KBI (22 stars, last commit 2020-05-24).

Abstract

While several matrix factorization (MF) and tensor factorization (TF) models have been proposed for knowledge base (KB) inference, they have rarely been compared across various datasets. Is there a single model that performs well across datasets? If not, what characteristics of a dataset determine the performance of MF and TF models? Is there a joint TF+MF model that performs robustly on all datasets? We perform an extensive evaluation to compare popular KB inference models across popular datasets in the literature. In addition to answering the questions above, we remove a limitation in the standard evaluation protocol for MF models, propose an extension to MF models so that they can better handle out-of-vocabulary (OOV) entity pairs, and develop a novel combination of TF and MF models. We also analyze and explain the results based on models and dataset characteristics. Our best model is robust, and obtains strong results across all datasets.

View on arXivView PDF

Code Implementations(1)

dair-iitd/KBIOfficial100%
223Shell, PythonNov 28, 20176 years agoNOASSERTION

Similar Papers

Cite this paper

@article{jain2017joint,
  title  = {Joint Matrix-Tensor Factorization for Knowledge Base Inference},
  author = {Prachi Jain and Shikhar Murty and Mausam and Soumen Chakrabarti},
  year   = {2017},
  eprint = {1706.00637},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1706.00637}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1706.00637.svg)](https://codeofpaper.com/paper/1706.00637)

Discussion