Data Mining and Knowledge Discovery

, Volume 25, Issue 2, pp 298–324

Tensor factorization using auxiliary information

Authors

  • Atsuhiro Narita
    • Department of Mathematical InformaticsThe University of Tokyo
  • Kohei Hayashi
    • Department of Mathematical InformaticsThe University of Tokyo
  • Ryota Tomioka
    • Department of Mathematical InformaticsThe University of Tokyo
    • Department of Mathematical InformaticsThe University of Tokyo
    • Basic Research Programs PRESTOSynthesis of Knowledge for Information Oriented Society

DOI: 10.1007/s10618-012-0280-z

Abstract

Most of the existing analysis methods for tensors (or multi-way arrays) only assume that tensors to be completed are of low rank. However, for example, when they are applied to tensor completion problems, their prediction accuracy tends to be significantly worse when only a limited number of entries are observed. In this paper, we propose to use relationships among data as auxiliary information in addition to the low-rank assumption to improve the quality of tensor decomposition. We introduce two regularization approaches using graph Laplacians induced from the relationships, one for moderately sparse cases and the other for extremely sparse cases. We also give present two kinds of iterative algorithms for approximate solutions: one based on an EM-like algorithms which is stable but not so scalable, and the other based on gradient-based optimization which is applicable to large scale datasets. Numerical experiments on tensor completion using synthetic and benchmark datasets show that the use of auxiliary information improves completion accuracy over the existing methods based only on the low-rank assumption, especially when observations are sparse.

Keywords

Tensors Multi-way arrays CP-decomposition Tucker decomposition Side information

Acknowledgments

The authors would like to thank the anonymous reviewers of ECML PKDD 2011 for their valuable comments and suggestions to improve the quality of the paper.

Open Access

This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.

Copyright information

© The Author(s) 2012