Conference

### On restricted nonnegative matrix factorization

Abstract:

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n × m matrix M into a product of a nonnegative n × d matrix W and a nonnegative d × m matrix H. Restricted NMF requires in addition that the column spaces of M and W coincide. Finding the minimal inner dimension d is known to be NP-hard, both for NMF and restricted NMF. We show that restricted NMF is closely related to a question about the nature of minimal probabilistic automata, posed by Paz in his semi...

Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

### Access Document

Files:
• (pdf, 650.1KB)
Publisher copy:
10.4230/LIPIcs.ICALP.2016.103

### Authors

More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Publisher:
Schloss Dagstuhl Publisher's website
Volume:
103
Pages:
103:1-103:14
Publication date:
2016-07-05
DOI:
EISSN:
1868-8969
ISSN:
1868-8969
URN:
uuid:7308840d-83fb-4759-b803-9cb412fbb70d
Source identifiers:
623536
Local pid:
pubs:623536
Keywords: