학술논문

Ultra Data-Oriented Parallel Fractional Hot-Deck Imputation With Efficient Linearized Variance Estimation
Document Type
Periodical
Source
IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 35(9):9754-9768 Sep, 2023
Subject
Computing and Processing
Indexes
Memory management
Mathematical models
Feature extraction
Deep learning
Curing
Parallel algorithms
parallel linearized variance estimation
two-staged feature selection
ultra data-oriented parallel fractional hot-deck imputation
ultra incomplete data
ultrahigh dimensional missing data curing
Language
ISSN
1041-4347
1558-2191
2326-3865
Abstract
Parallel fractional hot-deck imputation (P-FHDI (Yang et al. 2020)) is a general-purpose, assumption-free tool for handling item nonresponse in big incomplete data by combining the theory of FHDI and parallel computing. FHDI cures multivariate missing data by filling each missing unit with multiple observed values (thus, hot-deck) without resorting to distributional assumptions. P-FHDI can tackle big incomplete data with millions of instances (big-$n$n) or 10,000 variables (big-$p$p). However, handling ultra incomplete data (i.e., concurrently big-$n$n and big-$p$p) with tremendous instances and high dimensionality has posed problems to P-FHDI due to excessive memory requirement and execution time. To tackle the aforementioned challenges, we propose the ultra data-oriented P-FHDI (named UP-FHDI) capable of curing ultra incomplete data. In addition to the parallel Jackknife method, this paper enables a computationally efficient ultra data-oriented variance estimation using parallel linearization techniques. Results confirm that UP-FHDI can tackle an ultra dataset with one million instances and 10,000 variables. This paper illustrates the special parallel algorithms of UP-FHDI and confirms its positive impact on the subsequent deep learning performance.