Uchanganuzi wa Matrix Usio-na-Hasara (NMF)
Uchanganuzi wa Matrix Usio-na-Hasara (NMF) ni familia ya algoriti, zilizotambulishwa na Lee na Seung katika karatasi yao muhimu ya Nature ya 1999, ambayo hupasua matrix ya data isiyo-na-hasara V kuwa bidhaa ya matrices mbili za kiwango cha chini kisicho-na-hasara W (sehemu za msingi) na H (vigawe vya usimbaji). Tofauti na PCA au SVD, kizuizi cha kutokuwa na hasara hulazimisha algoriti kujifunza uwakilishi wa sehemu tu, unaojumuisha, na kuwezesha vipengele kutafsiriwa moja kwa moja kama vipengele vya ujenzi wa data asili.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
+1 more
Vyanzo
- 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. link ↗
- 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
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Non-negative Matrix Factorization (Lee & Seung, 1999). ScholarGate. https://scholargate.app/sw/machine-learning/non-negative-matrix-factorization
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Uchanganuzi wa vipengele huru (ICA)Ujifunzaji wa Mashine↔ compare
- K-Means ClusteringUjifunzaji wa Mashine↔ compare
- Uchambuzi wa Latent Dirichlet (LDA)Ujifunzaji wa Mashine↔ compare
- Uchanganuzi wa Thamani PekeeMbinu za Nambari↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →