Towards Multiple-Imputation-Proper Predictive Mean Matching

• Activity Number: 512 - Various Flavors of Missing-Data Problems
• Type: Topic Contributed
• Date/Time: Wednesday, August 1, 2018 : 10:30 AM to 12:20 PM
• Sponsor: Survey Research Methods Section
• Author(s): Philipp Gaffert* and Florian Meinfelder and Volker Bosch
• Companies: GfK SE and Universität Bamberg and GfK SE
• Keywords: Approximate Bayesian bootstrap; Distance-based donor selection; Hot deck imputation; Multiple imputation; Predictive mean matching; Proper imputation

Abstract

Rubin 1987 introduced multiple imputation in a parametric Bayesian framework and considers it proper if the uncertainty of the imputation fully propagates. Augmenting it with a semiparametric concept like predictive mean matching (Rubin 1986, Little 1988) promises both, valid inferences and robustness against some model misspecifications. Although numerous multiple imputation predictive mean matching algorithms exist their theoretical properties remain largely unexplored. In this talk, we show why all of these algorithms are improper, but the one by Siddique & Belin 2008. On this exception we build a new algorithm and demonstrate its superiority in terms of coverages of frequentist confidence intervals within a comparative simulation study.