Módszerek összehasonlítása

	EM-algoritmus	Mátrixkompleció	Többszörös imputáció
Tudományterület	Statisztika	Gépi tanulás	Statisztika
Módszercsalád	Machine learning	Machine learning	Process / pipeline
Keletkezés éve	1977	2009	1987
Megalkotó	Dempster, Laird & Rubin	Emmanuel Candès & Benjamin Recht	Donald B. Rubin
Típus	Iterative optimization algorithm	Convex low-rank recovery	Missing-data handling procedure
Alapmű	Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–38.	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.
Alternatív nevek	EM, Expectation-Maximization, Maximum Likelihood via Incomplete Data, BM Algoritması	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)
Kapcsolódó	2	2	1
Összefoglaló	The Expectation-Maximization (EM) algorithm is an iterative optimization procedure for finding maximum likelihood or maximum a posteriori estimates of parameters in statistical models with latent variables or missing data. Introduced by Dempster, Laird, and Rubin in their landmark 1977 paper, EM alternates between computing the expected complete-data log-likelihood (E-step) and maximizing it with respect to the parameters (M-step), guaranteeing monotone non-decreasing likelihood at each iteration.	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.