Conference item icon

Conference item

On restricted nonnegative matrix factorization

Abstract:

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \times m$ matrix $M$ into a product of a nonnegative $n \times d$ matrix $W$ and a nonnegative $d \times 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 a...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Publisher copy:
10.4230/LIPIcs.ICALP.2016.103

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Oxford college:
Merton College
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Oxford college:
Green Templeton College
Role:
Author
Publisher:
Dagstuhl Publishing
Host title:
International Colloquium on Automata, Languages and Programming 2016
Journal:
International Colloquium on Automata, Languages and Programming 2016 More from this journal
Publication date:
2016-07-01
Acceptance date:
2016-04-15
DOI:
Keywords:
Pubs id:
pubs:623536
UUID:
uuid:92d56b76-c925-4ee1-a2a9-997de73cdb04
Local pid:
pubs:623536
Source identifiers:
623536
Deposit date:
2016-08-11

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP