Technical Reports

The ICICS/CS Reading Room


UBC CS TR-2006-21 Summary

Computing nonnegative tensor factorizations, October 19, 2006 (Revised October 7, 2007) Michael P, Friedlander and Kathrin Hatz, 16 pages

Nonnegative 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 nonnegative matrix factorization. (The better-known nonnegative matrix factorization 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.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.