Numerical Data Imputation for Multimodal Data Sets: A Probabilistic Nearest-Neighbor Kernel Density Approach
Not on the map. Why?
Abstract (arXiv)
Numerical data imputation algorithms replace missing values by estimates to leverage incomplete data sets. Current imputation methods seek to minimize the error between the unobserved ground truth and the imputed values. But this strategy can create artifacts leading to poor imputation in the presence of multimodal or complex distributions. To tackle this problem, we introduce the kNN×KDE algorithm: a data imputation method combining nearest neighbor estimation (kNN) and density estimation with Gaussian kernels (KDE). We compare our method with previous data imputation methods using artificial and real-world data with different data missing scenarios and various data missing rates, and show that our method can cope with complex original data structure, yields lower data imputation errors, and provides probabilistic estimates with higher likelihood than current methods. We release the code in open-source for the community: https://github.com/DeltaFloflo/knnxkde
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 8 of its 44 references that are in the map. First posted on arXiv 29 Jun 2023.
Builds on
8 of 44 references.
References · 8
- 2018GAIN: Missing Data Imputation using Generative Adversarial Netscited by 349
- 2022Why do tree-based models still outperform deep learning on tabular data?cited by 198
- 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
- 2020Missing Data Imputation using Optimal Transportcited by 99
- 2019Analyzing and Improving Representations with the Soft Nearest Neighbor Losscited by 95
- 2021What's a good imputation to predict with missing values?cited by 61
- 2020Does imputation matter? Benchmark for predictive modelscited by 7
- 2016Missing Data Imputation for Supervised Learningcited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.