4.5 Article Proceedings Paper

Computing non-negative tensor factorizations

Journal

OPTIMIZATION METHODS & SOFTWARE
Volume 23, Issue 4, Pages 631-647

Publisher

TAYLOR & FRANCIS LTD
DOI: 10.1080/10556780801996244

Keywords

N-dimensional arrays; tensors; non-negative tensor factorization; alternating least-squares; block Gauss-Seidel; sparse solutions; regularization; non-negative least-squares

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available