On the complexity of nonnegative matrix factorization

Details On the complexity of nonnegative matrix factorization On the complexity of nonnegative matrix factorization

2007-08-30

arxiv.org/abs/0708.4149v2

Computer Science

Numerical Analysis

Version 2 corrects small typos; adds ref to Cohen & Rothblum; adds ref to Gillis; clarifies reduction of NMF to int. simplex

Scientific paper

Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases and other information retrieval and clustering applications. In this report, we define an exact version of NMF. Then we establish several results about exact NMF: (1) that it is equivalent to a problem in polyhedral combinatorics; (2) that it is NP-hard; and (3) that a polynomial-time local search heuristic exists.

Affiliated with

Also associated with

No associations

Rating

On the complexity of nonnegative matrix factorization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of nonnegative matrix factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of nonnegative matrix factorization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-206007