So sánh phương pháp

	Matrix Completion	Phân tích ma trận không âm (NMF)
Lĩnh vực	Học máy	Học máy
Họ	Machine learning	Latent structure
Năm ra đời	2009	1999
Người khởi xướng	Emmanuel Candès & Benjamin Recht	Lee, D. D. & Seung, H. S.
Loại	Convex low-rank recovery	Matrix decomposition with non-negativity constraints
Công trình gốc	Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772.	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.
Tên gọi khác	Nuclear Norm Minimization, Collaborative Filtering via Low-Rank Recovery, Inductive Matrix Completion, Matris Tamamlama	NMF, NNMF, nonnegative matrix factorization, non-negative matrix approximation
Liên quan	2	4
Tóm tắt	Matrix Completion is a technique for recovering a low-rank matrix from a small, possibly random subset of its entries. Introduced by Emmanuel Candès and Benjamin Recht in 2009, it reformulates the problem as nuclear norm minimization — a convex surrogate for rank minimization — and provides theoretical guarantees that exact recovery is achievable when entries are observed uniformly at random and the matrix satisfies an incoherence condition.	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.