Computing non-negative tensor factorizations.
Saved in:
| Title: | Computing non-negative tensor factorizations. |
|---|---|
| Authors: | Friedlander, MichaelP.1 (AUTHOR) mpf@cs.ubc.ca, Hatz, Kathrin2 (AUTHOR) |
| Source: | Optimization Methods & Software. Aug2008, Vol. 23 Issue 4, p631-647. 17p. 1 Black and White Photograph, 1 Chart. |
| Subjects: | Least squares software, Sparse matrix software, Factorization, Mathematical optimization, Mathematical analysis |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Optimization Methods & Software is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| 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. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10556788 |
| DOI: | 10.1080/10556780801996244 |
