Non-negative matrix factorization with sparseness constraints

Details Non-negative matrix factorization with sparseness constraints Non-negative matrix factorization with sparseness constraints

2004-08-25

arxiv.org/abs/cs/0408058v1

Computer Science

Learning

Scientific paper

Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been applied in several applications, it does not always result in parts-based representations. In this paper, we show how explicitly incorporating the notion of `sparseness' improves the found decompositions. Additionally, we provide complete MATLAB code both for standard NMF and for our extension. Our hope is that this will further the application of these methods to solving novel data-analysis problems.

Affiliated with

Also associated with

No associations

Rating

Non-negative matrix factorization with sparseness constraints 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 Non-negative matrix factorization with sparseness constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-negative matrix factorization with sparseness constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-476265