Nonparametric Imputation by Data Depth
Pavlo Mozharovskyi
Julie Josse
François Husson
10.6084/m9.figshare.7590851.v2
https://tandf.figshare.com/articles/dataset/Nonparametric_imputation_by_data_depth/7590851
<p>We present single imputation method for missing values which borrows the idea of data depth—a measure of centrality defined for an arbitrary point of a space with respect to a probability distribution or data cloud. This consists in iterative maximization of the depth of each observation with missing values, and can be employed with any properly defined statistical depth function. For each single iteration, imputation reverts to optimization of quadratic, linear, or quasiconcave functions that are solved analytically by linear programming or the Nelder–Mead method. As it accounts for the underlying data topology, the procedure is distribution free, allows imputation close to the data geometry, can make prediction in situations where local imputation (<i>k</i>-nearest neighbors, random forest) cannot, and has attractive robustness and asymptotic properties under elliptical symmetry. It is shown that a special case—when using the Mahalanobis depth—has direct connection to well-known methods for the multivariate normal model, such as iterated regression and regularized PCA. The methodology is extended to multiple imputation for data stemming from an elliptically symmetric distribution. Simulation and real data studies show good results compared with existing popular alternatives. The method has been implemented as an R-package. <a href="https://doi.org/10.1080/01621459.2018.1543123" target="_blank">Supplementary materials</a> for the article are available online.</p>
2019-04-11 19:41:19
Convex optimization
Elliptical symmetry
Local depth
Nonparametric imputation
Outliers
Tukey depth
Zonoid depth