2004 JMLR JMLR 2004

Non-negative Matrix Factorization with Sparseness Constraints

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. [abs] [ pdf ]

🌱 Topic Pioneer — Linear Algebra
🌉 Interdisciplinary Bridge — Machine Learning and Mathematics & Optimization
📈 Trend Setter — Linear Algebra
🧭 Keyword Pioneer — linear representation
🐝 Cross-Pollinator — Artificial Intelligence, Computer Vision, Data Science & Analytics, Deep Learning, Machine Learning, Mathematics & Optimization
🐣 Hot Topic Early Bird — dimensionality reduction

Authors