Penalizing Low-Rank Matrix Factorization: From theoretical connections to practical applications
Low-rank (LR) factorization techniques aim to represent data in a low-dimensional space by identifying fundamental sources. Standard LR approaches often require additional constraints to account for real-world complexity, resulting in penalized low-rank matrix factorizations. These techniques incorporate penalties or regularization terms to improve robustness and adaptability to practical constraints, bridging theoretical research with real-world applications. This paper explores a nonnegative constrained low-rank decomposition technique, namely, Nonnegative Matrix Factorization (NMF), and its constrained variants as powerful tools for analyzing nonnegative data. We cover theoretical foundations and practical implementations, review algorithms for standard NMF, and address challenges in setting hyperparameters for penalized variants. We emphasize applications in omics data analysis with a model that incorporates biological constraints to extract meaningful insights, and highlight applications in environmental data analysis
Authors
- Nicoletta Del Buono (ORCID: https://orcid.org/0000-0001-5079-875X)
- Laura Selicato (ORCID: https://orcid.org/0000-0001-9248-3879)
- Flavia Esposito (ORCID: https://orcid.org/0000-0002-2791-9610)
Publication Details
- Journal
- Journal of Computational Mathematics and Data Science
- Published
- 2025-02-22
- DOI
- https://doi.org/10.1016/j.jcmds.2025.100111
- Citations
- 1
- Primary Topic
- Blind Source Separation Techniques
- Type
- article
- Field-Weighted Citation Impact
- 1.49
Funders
- Universita degli Studi di Bari Aldo Moro