Link prediction in multirelational graphs using additive models

Abstract. We present a general and novel framework for predicting links in multirelational graphs using a set of matrices describing the var-ious instantiated relations in the knowledge base. We construct matrices that add information further remote in the knowledge graph by join op-erations and we describe how unstructured information can be integrated in the model. We show that efficient learning can be achieved using an alternating least squares approach exploiting sparse matrix algebra and low-rank approximations. We discuss the relevance of modeling nonlinear interactions and add corresponding model components. We also discuss a kernel solution which is of interest when it is easy to define sensible kernels. We discuss the relevance of feature selection for the interaction terms and apply a random search strategy to tune the hyperparameters in the model. We validate our approach using data sets from the Linked Open Data (LOD) cloud and from other sources.