Multiple imputation by chained equations (MICE) fills missing values repeatedly, analyses each completed dataset, and pools the results by Rubin's rules.
When data are missing, listwise deletion discards information and biases the analysis if missingness depends on observed variables (MAR). MI imputes plausible values m times (each draw reflects the uncertainty about the true value), runs the analysis on each completed dataset, and pools the m estimates via Rubin's rules — combining within-imputation variance (sampling uncertainty) and between-imputation variance (missingness uncertainty).
MICE generates the m imputations by iteratively regressing each variable with missing data on the others (predictive mean matching for numeric, logistic regression for binary, proportional-odds for ordered, etc.). After enough iterations the imputations stabilise.
The fraction of missing information (FMI) per coefficient tells you how much of the SE comes from the missingness rather than the sampling. FMI > 0.2 ⇒ imputation-dominated; consider increasing m (more imputations stabilise the estimate) or rethinking the imputation model.
Response + predictors + # imputations m (default 5) + MICE iterations + RNG seed.
Per-column missingness % + the auto-selected imputation method per column; pooled β / SE / Barnard-Rubin df / p / 95% CI / FMI per coefficient.
m = 5 is the historical default; current recommendations are m ≈ % missing (Bodner 2008). For 30% missing, use m = 30.
If FMI > 0.5, the analysis is heavily driven by the imputation; consider whether MNAR-style sensitivity analysis is needed.