विधियों की तुलना करें

	ऋणात्मक मैट्रिक्स गुणनखंडन (NMF)	एकवचन मान अपघटन
क्षेत्र	मशीन अधिगम	संख्यात्मक विधियाँ
परिवार	Latent structure	Machine learning
उद्भव वर्ष	1999	1965
प्रवर्तक	Lee, D. D. & Seung, H. S.	Gene Golub
प्रकार	Matrix decomposition with non-negativity constraints	Linear algebra decomposition
मौलिक स्रोत	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.	Golub, G. H., & Kahan, W. (1970). Calculating the singular values and pseudo-inverse of a matrix. Journal of the SIAM Series B: Numerical Analysis, 2(2), 205–224.
उपनाम	NMF, NNMF, nonnegative matrix factorization, non-negative matrix approximation	SVD, thin SVD, reduced SVD
संबंधित	4	0
सारांश	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.	Singular Value Decomposition (SVD) is a fundamental matrix factorization technique that decomposes any m × n matrix A into the product A = U Σ V^T, where U and V are orthogonal matrices and Σ is a diagonal matrix of singular values. Developed by Gene Golub and others in the 1960s–1970s, SVD is the most robust method for analyzing matrix structure and solving linear systems.