Simulation study evaluates tree-based imputation methods for multi-level data.
problem Ignoring dependencies in hierarchical data can compromise imputation accuracy.
method Chained Random Forests and Extreme Gradient Boosting (mixgb) adapted for multi-level data.
result Adapted boosting methods outperform traditional MICE for Level-1 variables at higher missingness rates.
Study compares tree-based imputation methods to MICE PMM for missing data.
problem Missing data in empirical studies.
method Various imputation methods including MICE PMM, RF, missRanger, and MIXGBoost.
result Tree-based imputations, especially RF and missRanger with PMM, perform better.
Survey data imputation methods impact feature selection and importance assessment.
problem Impact of different imputation methods on feature selection and importance assessment in survey data.
method Investigated eight imputation methods (listwise deletion, MICE, missRanger, mixGBoost) and three learners (Random Forest, XGBoost, linear model) in a simulation study.
result Different imputation methods yield varying feature selection and importance assessments.
Improved time series classification with imputed data using label-guided forest-based methods.
problem Missing data in time series data.
method Label-guided imputation using forest-based proximity measures.
result Imputation leads to higher classification accuracies, even with imputed values differing from true values.
Standard methods for anomaly detection assume that all features are observed at both learning time and prediction time. Such methods cannot process data containing missing values. This paper studies five strategies for handling missing values in test queries: (a) mean imputation, (b) MAP imputation, (c) reduction (redu…
The real-time crash likelihood prediction has been an important research topic. Various classifiers, such as support vector machine (SVM) and tree-based boosting algorithms, have been proposed in traffic safety studies. However, few research focuses on the missing data imputation in real-time crash likelihood predictio…
We present a method for incorporating missing data in non-parametric statistical learning without the need for imputation. We focus on a tree-based method, Bayesian Additive Regression Trees (BART), enhanced with "Missingness Incorporated in Attributes," an approach recently proposed incorporating missingness into deci…
Study tackles variable selection with missing covariates and outcomes using machine learning and imputation.
problem Missing data in both covariates and outcomes complicates variable selection in health studies.
method Exploits machine learning flexibility and bootstrap imputation for variable selection, comparing multiple methods.
result XGBoost and BART perform best in variable selection with bootstrap imputation, achieving high F1 scores and low Type I errors. This paper compares preprocessing techniques for XGBoost models on various data sets.
problem Improving predictive performance of XGBoost models through optimal data preprocessing.
method Comparison of feature selection, categorical handling, and null imputation methods.
result XGBoost importance by gain is the most consistent and highest-performing method for feature selection.
New trees-based models handle correlated data better.
problem Standard trees-based models ignore correlation structure.
method Explicitly accounts for correlation structure in splitting criterion, stopping rules, and fitted values.
result New approach superior to standard models in simulations and real data.
Study reviews tree-based methods and introduces new ensemble strategies.
problem Improving the efficiency and performance of tree-based machine learning models.
method Review of tree-based methods, introduction of ISLE framework, ARM model combination strategy, and modified ISLEs.
result Performance evaluation of modified ISLEs on real data sets.
A new imputation method MissARF uses adversarial random forests for fast and accurate missing value imputation.
problem Handling missing values in biostatistical analyses.
method Adversarial Random Forests (ARF) for density estimation and data synthesis.
result MissARF performs comparably to state-of-the-art methods in imputation quality and runtime.
Proposes CBMI for missing data imputation using labels and input.
problem Missing data in practical data science settings.
method CBMI: imputes labels and input simultaneously; IUL: stacks label into input.
result CBMI improves classification accuracy, especially for imbalanced and categorical data.
IGANI uses iterative GANs to improve traffic data imputation.
problem Imputation of traffic data in the absence of sensor data.
method Iterative Generative Adversarial Networks (IGANI) for unsupervised learning.
result IGANI produces more accurate imputation results compared to previous methods.
The main goal of this paper is to study the geometric structures associated with the representation of tensors in subspace based formats. To do this we use a property of the so-called minimal subspaces which allows us to describe the tensor representation by means of a rooted tree. By using the tree structure and the d…
A new PCA-based imputation method for high-dimensional data.
problem Missing data in high-dimensional datasets.
method Principal Component Analysis Imputation (PCAI) framework.
result PCAI significantly speeds up imputation and maintains high accuracy.
Imputation for prediction often offers limited benefits, especially with powerful models.
problem The challenge of missing data in predictive models.
method Comparative analysis of imputation methods across various predictive models and datasets.
result Advanced imputation methods often offer limited benefits for powerful predictive models.
Framework for imputing time series data with uncertainty measures.
problem Handling missing values in time series data, especially in healthcare.
method Uncertainty-aware multivariate time series imputation framework.
result Selective imputation of less uncertain values improves downstream tasks.
New method improves feature selection in tree-based models.
problem Previous feature selection methods in tree-based models lack sufficient regularization and sub-optimal performance.
method Developed a new gain penalization approach for tree-based models that allows for flexible feature-specific importance weights.
result The new method improves out-of-sample performance, especially with correlated features.
CSDI improves time series imputation by 40-65% over existing methods.
problem Imputing missing values in time series data.
method Conditional Score-based Diffusion models conditioned on observed data.
result CSDI improves by 40-65% over existing probabilistic imputation methods on popular metrics.
MTSCI uses diffusion models to impute multivariate time series data with consistency.
problem Imputation of missing values in multivariate time series data.
method MTSCI employs a contrastive complementary mask and mixup mechanism to ensure intra-consistency and inter-consistency.
result MTSCI achieves state-of-the-art performance on multivariate time series imputation tasks.
Study examines parallel computing strategies for faster imputation of missing data.
problem Time-consuming iterative imputation methods for large datasets.
method Variable-wise and model-wise distributed parallel computing strategies in missForest.
result Variable-wise distributed strategy introduces additional biases in imputation results.
Study compares imputation methods' effects on IML confidence intervals.
problem Missing data impacts IML interpretation and confidence intervals.
method Compared single vs multiple imputation methods on IML confidence intervals.
result Multiple imputation provides closer coverage to nominal than single imputation.
New research shows imputation and regression together can predict better than separate steps.
problem Predicting with data missing values without strong assumptions.
method Proposes a joint imputation and regression approach using NeuMiss neural network.
result Joint imputation and regression outperforms separate imputation and regression methods.
Enhanced tree-based classifiers use derivatives and geometry for better function classification.
problem Improving classification of high-dimensional time series data.
method Integrates Functional Data Analysis with tree-based ensemble techniques, leveraging derivative and geometric features.
result Significant improvements over traditional approaches in function classification.
The paper compares theoretical and empirical performance of imputation methods for missing data.
problem Missing data in real-world datasets.
method Contrast of theoretical and empirical imputation methods for prediction.
result Mean-imputation is asymptotically optimal for prediction, while mode-imputation is sub-optimal.
New criteria improve imputation model selection using MOO.
problem Selecting the best imputation model using prediction accuracy metrics.
method Introduced three modified MOO criteria based on rank transformation, energy distance, and likelihood principle.
result Demonstrated how MOO is related to missing-at-random assumption and derived statistical and computational learning theories.
New algorithm improves data imputation for complex multimodal data sets.
problem Artifacts in imputation methods for multimodal distributions.
method Combines kNN and KDE for probabilistic estimates. result Lower imputation errors and higher likelihood estimates.
GANs improve missing data imputation for ranking tasks.
problem Missing data in ranking datasets violates standard assumptions.
method Conditional Imputation GAN for Extended Missing At Random and Extended Always Missing At Random mechanisms.
result Optimal GAN imputation for EMAR and EAMAR mechanisms.
Autoencoder improves imputation across various missing data types.
problem Efficiently impute missing data in diverse datasets.
method Developed a deep autoencoder framework for consistent training and imputation.
result Autoencoder outperformed state-of-the-art methods in all experiments.
IFGAN uses feature-specific GANs for missing value imputation.
problem Missing value imputation in data mining.
method Feature-specific Generative Adversarial Networks (GAN).
result IFGAN outperforms state-of-the-art algorithms in various missing conditions.
Missing data imputation can help improve the performance of prediction models in situations where missing data hide useful information. This paper compares methods for imputing missing categorical data for supervised classification tasks. We experiment on two machine learning benchmark datasets with missing categorical…
Kernel ridge regression imputation with consistent variance estimation for handling missing data.
problem Handling missing data in statistical analysis.
method Kernel ridge regression imputation combined with entropy method for variance estimation.
result Root-n consistency of the imputation estimator in a Sobolev space setting.
New method for imputing missing data in multi-view data.
problem Large missing data sets in multi-view data.
method Stacked penalized logistic regression (StaPLR) in a dimension-reduced space.
result New method performs competitively with lower computational cost.
Paper introduces metrics to evaluate missing data imputation without ground truth.
problem Handling missing data in time series without ground truth.
method Introduces Wasserstein distance (WD) and Jensen-Shannon divergence (JSD) as metrics to evaluate imputation quality.
result WD and JSD are effective metrics for assessing missing data imputation quality.
This work proposes a non-iterative strategy for missing value imputations which is guided by similarity between observations, but instead of explicitly determining distances or nearest neighbors, it assigns observations to overlapping buckets through recursive semi-random hyperplane cuts, in which weighted averages are…
Paper proposes methods to handle missing data in online RL, improving efficiency and uncertainty capture.
problem Missing data in online RL poses challenges due to the need to impute and act at each time step.
method Proposes fully online imputation ensembles and multiple imputation pathways to balance uncertainty and efficiency.
result Preliminary evidence suggests multiple imputation pathways can be a useful framework for simple and efficient online missing data RL methods.
New online imputation method for mixed data improves accuracy and speed.
problem Missing value imputation in online settings for mixed data types.
method Online Gaussian copula model for imputation and change point detection.
result The model improves accuracy and speed, especially on large datasets.
LSSDM improves imputation of multivariate time series data.
problem Imputation of multivariate time series data without labels.
method LSSDM projects observed data into latent space, reconstructs missing values without labels, and uses a conditional diffusion model for precise imputation.
result LSSDM achieves superior imputation performance and uncertainty analysis.
CFMI improves missing data imputation across various data types and dimensions.
problem Imputing missing data in complex, high-dimensional datasets.
method Combines normalising flows, flow-matching, and shared conditional modelling.
result Outperforms traditional and modern imputation methods across multiple metrics.
RISA improves VFL by using imputed samples with low uncertainty.
problem Limited overlapping samples constrain VFL performance.
method Imputing non-overlapping samples and using evidence theory to select reliable imputed samples.
result Significant performance gains achieved, especially with limited overlapping samples.
Imputation with missing-indicators improves machine learning performance, especially for categorical attributes.
problem Missing values in datasets can be lost through imputation, potentially reducing model performance.
method Combines missing-indicator approach with imputation strategies on real datasets.
result Missing-indicators generally increase classification performance, especially for categorical attributes.
Imputation of missing data is a common application in various classification problems where the feature training matrix has missingness. A widely used solution to this imputation problem is based on the lazy learning technique, k-nearest neighbor (kNN) approach. However, most of the previous work on missing data does…
Paper proposes a novel method to reduce mutual information for missing data imputation.
problem Missing data imputation in datasets with missingness patterns.
method Iterative minimization of KL divergence between imputed data and missingness mask, using rectified flow training objective.
result The proposed method achieves superior imputation performance on synthetic and real-world datasets.
RDIS fills missing values in time series data explicitly.
problem Missing values in time series data.
method Random Drop Imputation with Self-training.
result RDIS achieves competitive results on real-world datasets.
tBayes-MICE uses Bayesian MICE for time series data imputation.
problem Missing data in time series data.
method Bayesian MICE with MCMC, temporal features, and different samplers.
result tBayes-MICE reduces imputation errors and accounts for uncertainty.
Imputation method respects manifold structure for missing data.
problem Missing data imputation in high-dimensional data.
method Model-based imputation using mixture variational autoencoders and sampling-importance-resampling (SIR).
result Competitive performance and uncertainty quantification in imputations.
Study finds unsupervised imputation before cross-validation can reduce computational costs without significantly degrading model performance.
problem High computational costs in pipeline modeling algorithms with imputation steps.
method Empirical assessment of unsupervised imputation before vs during cross-validation.
result Reduced variance of imputation before cross-validation leads to lower overall root mean squared error.