|
| 1 | +# This CITATION.cff file was generated with cffinit. |
| 2 | +# Visit https://bit.ly/cffinit to generate yours today! |
| 3 | + |
| 4 | +cff-version: 1.2.0 |
| 5 | +title: 'GSVD-NMF: Recovering Missing Features in Non-negative Matrix Factorization' |
| 6 | +message: >- |
| 7 | + If you use this software, please cite it using the |
| 8 | + metadata from this file. |
| 9 | +type: software |
| 10 | +authors: |
| 11 | + - given-names: Youdong |
| 12 | + family-names: Guo |
| 13 | + orcid: 'https://orcid.org/0009-0007-7787-3722' |
| 14 | + - given-names: Timothy E. |
| 15 | + family-names: Holy |
| 16 | + orcid: 'https://orcid.org/0000-0002-2429-1071' |
| 17 | +identifiers: |
| 18 | + - type: url |
| 19 | + value: 'https://arxiv.org/abs/2408.08260' |
| 20 | + description: The ArXiv deposit of the encompassing paper. |
| 21 | +doi: 'https://doi.org/10.48550/arXiv.2408.08260' |
| 22 | +repository-code: 'https://github.com/HolyLab/GsvdInitialization.jl' |
| 23 | +abstract: >- |
| 24 | + Non-negative matrix factorization (NMF) is an important |
| 25 | + tool in signal processing and widely used to separate |
| 26 | + mixed sources into their components. However, NMF is |
| 27 | + NP-hard and thus may fail to discover the ideal |
| 28 | + factorization; moreover, the number of components may not |
| 29 | + be known in advance and thus features may be missed or |
| 30 | + incompletely separated. To recover missing components from |
| 31 | + under-complete NMF, we introduce GSVD-NMF, which proposes |
| 32 | + new components based on the generalized singular value |
| 33 | + decomposition (GSVD) between preliminary NMF results and |
| 34 | + the SVD of the original matrix. Simulation and |
| 35 | + experimental results demonstrate that GSVD-NMF often |
| 36 | + recovers missing features from under-complete NMF and |
| 37 | + helps NMF achieve better local optima. |
0 commit comments