Non-negative matrix factorization with sparseness constraints

@misc{citeulike:423463, abstract = {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.}, author = {Hoyer, Patrik O. }, citeulike-article-id = {423463}, eprint = {cs.LG/0408058}, keywords = {factorization, matrix, non-negative, sparse}, month = {Aug}, posted-at = {2008-07-29 15:09:56}, priority = {2}, title = {Non-negative matrix factorization with sparseness constraints}, url = {http://arxiv.org/abs/cs.LG/0408058}, year = {2004} }

TY - ELEC ID - citeulike:423463 L3 - citeulike-article-id:423463 N2 - 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. TI - Non-negative matrix factorization with sparseness constraints KW - factorization KW - matrix KW - non-negative KW - sparse AU - Hoyer, Patrik PY - 2004/Aug/25/ UR - http://arxiv.org/abs/cs.LG/0408058 ER -