Convex and semi-nonnegative matrix factorizations
We present several new variations on the theme of nonnegative matrix factorization (NMF). Considering factorizations of the form X=FG(T), we focus on algorithms in which G is restricted to containing nonnegative entries, but allowing the data matrix X to have mixed signs, thus extending the applicab...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1998. - 32(2010), 1 vom: 08. Jan., Seite 45-55 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2010
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article Research Support, U.S. Gov't, Non-P.H.S. |
| Accès en ligne |
Volltext |