Advanced Search

Optimization Methods and Software

Volume 23, Issue 4, 2008

Special Issue: Mathematical programming in data mining and machine learning

Computing non-negative tensor factorizations

Computing non-negative tensor factorizations

DOI:
10.1080/10556780801996244
Michael P. Friedlandera* & Kathrin Hatzb

pages 631-647

Available online: 11 Jul 2008

Abstract

Non-negative tensor factorization (NTF) is a technique for computing a parts-based representation of high-dimensional data. NTF excels at exposing latent structures in datasets, and at finding good low-rank approximations to the data. We describe an approach for computing the NTF of a dataset that relies only on iterative linear-algebra techniques and that is comparable in cost to the non-negative matrix factorization (NMF). (The better-known NMF is a special case of NTF and is also handled by our implementation.) Some important features of our implementation include mechanisms for encouraging sparse factors and for ensuring that they are equilibrated in norm. The complete MATLAB software package is available under the GPL license.

Keywords

 

Details

  • Citation information:
  • Available online: 11 Jul 2008

Author affiliations

  • a Department of Computer Science, University of British Columbia, Vancouver, British Columbia, Canada
  • b Interdisciplinary Centre for Scientific Computing of the Ruprecht-Karls-University of Heidelberg, Germany

Librarians

Taylor & Francis Group