পদ্ধতির তুলনা করুন

	ম্যাট্রিক্স কমপ্লিশন	একাধিক প্রতিস্থাপন
ক্ষেত্র	যন্ত্র শিখন	পরিসংখ্যান
পরিবার	Machine learning	Process / pipeline
উদ্ভবের বছর	2009	1987
প্রবর্তক	Emmanuel Candès & Benjamin Recht	Donald B. Rubin
ধরন	Convex low-rank recovery	Missing-data handling procedure
মৌলিক উৎস	Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772.	Rubin, D.B. (1987). Multiple Imputation for Nonresponse in Surveys. Wiley.
অপর নাম	Nuclear Norm Minimization, Collaborative Filtering via Low-Rank Recovery, Inductive Matrix Completion, Matris Tamamlama	MICE, Multivariate Imputation by Chained Equations, Çoklu Atama (Multiple Imputation — MICE)
সম্পর্কিত	2	1
সারসংক্ষেপ	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.	Multiple Imputation (MI), formally introduced by Donald B. Rubin in 1987, is a principled statistical procedure for handling missing data. Rather than replacing each missing value once, MI fills the gaps m times — each time drawing plausible values from the posterior predictive distribution of the missing data — producing m complete datasets. Each dataset is analysed independently, and the results are combined into a single set of estimates using Rubin's pooling rules. The MICE variant (Multivariate Imputation by Chained Equations), popularised by van Buuren and Groothuis-Oudshoorn (2011), extends the approach to mixed variable types by imputing each variable in turn through a sequence of conditional regression models.