Non-negative Matrix Factorization
Non-negative Matrix Factorization (NMF) is a family of algorithms, introduced by Lee and Seung in their landmark 1999 Nature paper, that decomposes a non-negative data matrix V into the product of two lower-rank non-negative matrices W (basis components) and H (encoding coefficients). Unlike PCA or SVD, the non-negativity constraint forces the algorithm to learn strictly additive, parts-based representations, making the factors directly interpretable as building blocks of the original data.
Izvorni zapis
Citati kopirani doslovno iz izvornog zapisa metode. Ne impliciraju nikakvu provjeru na razini tvrdnje.
- Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791. · DOI 10.1038/44565
- Lee, D. D., & Seung, H. S. (2001). Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems, 13, 556–562. · URL
- Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S. (2009). Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. Wiley. · ISBN 978-0-470-74666-0
Uređene tvrdnje
Tvrdnje pohranjene u knjigu dokaza, svaka s vlastitom procjenom.
Ovaj prikaz ne izmišlja procjenu tvrdnje kada knjiga dokaza nema nijednu.
Povezane metode
Generirano iz grafa metode i prikazano kao strojno predložene relacije — ne implicira se nikakva tvrdnja dokaza.