Abstract
Non-negative matrix factorization (NMF) is a fundamental matrix decomposition technique that is used primarily for dimensionality reduction and is increasing in popularity in the biological domain. Although finding a unique NMF is generally not possible, there are various iterative algorithms for NMF optimization that converge to locally optimal solutions. Such techniques can also serve as a starting point for deep learning methods that unroll the algorithmic iterations into layers of a deep network. In this study, we develop unfolded deep networks for NMF and several regularized variants in both a supervised and an unsupervised setting. We apply our method to various mutation data sets to reconstruct their underlying mutational signatures and their exposures. We demonstrate the increased accuracy of our approach over standard formulations in analyzing simulated and real mutation data.
Original language | English |
---|---|
Pages (from-to) | 45-55 |
Number of pages | 11 |
Journal | Journal of Computational Biology |
Volume | 29 |
Issue number | 1 |
Early online date | 20 Jan 2022 |
DOIs | |
State | Published - Jan 2022 |
Event | RECOMB 2021: International Conference on Research in Computational Molecular Biology - Padova, Italy Duration: 18 Apr 2021 → 21 Apr 2021 Conference number: 2021 https://www.recomb2021.org/ |
Keywords
- NMF
- unfold and deep network
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Molecular Biology
- Genetics
- Computational Mathematics
- Computational Theory and Mathematics