ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Mecanismes de Dades Faltants: MCAR, MAR i MNAR×Algorisme EM×MICE×
CampEstadísticaEstadísticaEstadística
FamíliaProcess / pipelineMachine learningProcess / pipeline
Any d'origen197619772011
Autor originalDonald RubinDempster, Laird & RubinStef van Buuren & Karin Groothuis-Oudshoorn
TipusDiagnostic / classification frameworkIterative optimization algorithmIterative multiple imputation algorithm
Font seminalRubin, D. B. (1976). Inference and missing data. Biometrika, 63(3), 581–592. DOI ↗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. DOI ↗van Buuren, S., & Groothuis-Oudshoorn, K. (2011). mice: Multivariate imputation by chained equations in R. Journal of Statistical Software, 45(3), 1–67. DOI ↗
ÀliesMissing Data Typology, Rubin's Missing Data Framework, Missingness Mechanisms, Kayıp Veri MekanizmalarıEM, Expectation-Maximization, Maximum Likelihood via Incomplete Data, BM AlgoritmasıFully Conditional Specification, Sequential Regression Multivariate Imputation, Chained Equations Imputation, Zincirleme Denklemlerle Çoklu Atama
Relacionats323
ResumMissing data mechanisms, introduced by Donald Rubin in 1976, provide a formal taxonomy for classifying why observations are absent from a dataset. The three categories — Missing Completely At Random (MCAR), Missing At Random (MAR), and Missing Not At Random (MNAR) — describe the relationship between the probability of missingness and the observed or unobserved values. Identifying the correct mechanism is essential because it determines which analytical strategies preserve valid and unbiased inference.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.Multivariate Imputation by Chained Equations (MICE) is an iterative procedure for handling missing data in multivariate datasets. Introduced by Stef van Buuren and Karin Groothuis-Oudshoorn through the R package mice (2011), the algorithm fills each missing variable using a separate regression model conditioned on all other variables, cycling through variables repeatedly until the imputed values converge. The result is m completed datasets that are analysed separately and combined using Rubin's rules.
ScholarGateConjunt de dades
  1. v1
  2. 1 Fonts
  3. PUBLISHED
  1. v1
  2. 1 Fonts
  3. PUBLISHED
  1. v1
  2. 1 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Missing Data Mechanisms · EM Algorithm · MICE. Recuperat el 2026-06-15 de https://scholargate.app/ca/compare