GRAPE uses graph representation to handle missing data in feature imputation and label prediction.
problem Handling missing data in machine learning tasks.
method GRAPE uses a bipartite graph where observations and features are nodes, and observed feature values are edges. It formulates feature imputation as edge-level prediction and label prediction as node-level prediction, solving these with Graph Neural Networks.
result GRAPE achieves 20% lower mean absolute error for imputation and 10% lower for label prediction compared to state-of-the-art methods.
A new method for imputing missing data using graphical models.
problem Missing data in graphs and its impact on analysis.
method MMG framework based on conditional independence and PAI principle.
result Valid and efficient method for imputing missing data.
Graph imputation neural network (GINN) augments datasets by reconstructing damaged nodes.
problem Efficient data augmentation in semi-supervised learning with limited labeled data.
method Graph-based neural network (GINN) for missing data imputation and data augmentation.
result GINN can significantly improve semi-supervised learning performance and augment datasets up to 10x.
GATGPT uses LLMs with graph attention for spatiotemporal data imputation.
problem Missing values in spatiotemporal data due to sensor malfunctions and data transmission errors.
method Integrates pre-trained large language models with graph attention mechanisms.
result GATGPT achieves comparable results to deep learning benchmarks on real-world datasets.
FSD-CAP improves graph feature imputation under high missing rates.
problem Challenges in imputing missing node features in graphs, especially under high missing rates.
method Two-stage framework: subgraph expansion, fractional diffusion, class-aware propagation.
result Significantly improved imputation quality compared to existing methods, achieving high accuracy on benchmark datasets.
The paper compares two methods for handling missing data in causal discovery.
problem Handling missing data in causal discovery algorithms.
method Test-wise deletion and multiple imputation.
result Multiple imputation is more challenging for causal discovery than for estimation.
Method reconstructs missing wind farm data using graph theory and nearest neighbors.
problem Missing data in wind farm records due to sensor failures.
method Combines spectral graph theory and k-Nearest Neighbors to estimate missing data.
result Significant improvement in data reconstruction over existing methods.
This review synthesizes missing data imputation across diverse fields.
problem Missing data hinders analysis across various disciplines.
method Systematic review of imputation methods and their application across domains.
result Critical challenges and future directions identified.
PAIR-CI calibrates CI tests for causal discovery with incomplete data.
problem Miscalibration of CI tests when imputing incomplete data.
method Integrates multiple imputation directly into the inferential procedure via a paired permutation design.
result PAIR-CI reduces false positive rates to below 5% in simulations.
Casper uses causal graph neural networks to improve spatiotemporal time series imputation.
problem Imputing missing values in spatiotemporal time series with confounders and non-causal correlations.
method Casper introduces a novel Prompt Based Decoder (PBD) and Spatiotemporal Causal Attention (SCA) to block confounders and discover causal relationships.
result Casper outperforms baselines and effectively discovers causal relationships in spatiotemporal time series imputation.
KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.
problem Multi-way data imputation for high-dimensional functional MRI and dynamic graph recovery.
method Reformulates imputation as RKHS regression with TT-constrained coefficients and Hadamard overparameterization. Optimizes TT coefficients and kernel matrices on Riemannian manifolds.
result Consistently outperforms state-of-the-art methods in modeling accuracy.
KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.
problem Multi-way data imputation in high-dimensional spaces.
method Reformulates imputation as RKHS regression with TT-constrained coefficients, optimized on manifold frameworks.
result Consistently outperforms state-of-the-art methods in accuracy.
MGMC method handles missing data in medical datasets for accurate disease classification.
problem Handling missing data in incomplete medical datasets for accurate disease classification.
method Multigraph Geometric Matrix Completion (MGMC) using multiple graph convolutional networks.
result MGMC achieves superior classification and imputation performance compared to state-of-the-art approaches.
Graph auto-encoder predicts unobserved node features from biological networks and omics data.
problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.
Missing data imputation (MDI) is a fundamental problem in many scientific disciplines. Popular methods for MDI use global statistics computed from the entire data set (e.g., the feature-wise medians), or build predictive models operating independently on every instance. In this paper we propose a more general framework…
Laboratory testing and medication prescription are two of the most important routines in daily clinical practice. Developing an artificial intelligence system that can automatically make lab test imputations and medication recommendations can save costs on potentially redundant lab tests and inform physicians of a more…
Time series are widely used as signals in many classification/regression tasks. It is ubiquitous that time series contains many missing values. Given multiple correlated time series data, how to fill in missing values and to predict their class labels? Existing imputation methods often impose strong assumptions of the …
We introduce Graph Neural Processes (GNP), inspired by the recent work in conditional and latent neural processes. A Graph Neural Process is defined as a Conditional Neural Process that operates on arbitrary graph data. It takes features of sparsely observed context points as input, and outputs a distribution over targ…
We present a novel method named Latent Semantic Imputation (LSI) to transfer external knowledge into semantic space for enhancing word embedding. The method integrates graph theory to extract the latent manifold structure of the entities in the affinity space and leverages non-negative least squares with standard simpl…
A new framework learns cyclic causal graphs from incomplete data.
problem Learning causal models in systems with feedback loops and missing data.
method MissNODAGS framework, alternating imputation and likelihood maximization.
result Improved performance compared to imputation followed by causal learning.
GCN adapted for graphs with missing features, improving performance.
problem GCN struggles with graphs containing missing features.
method Integrates missing feature processing within GCN architecture using Gaussian Mixture Model.
result Significantly outperforms imputation-based methods in node classification and link prediction.
A matrix network is a family of matrices, with relatedness modeled by a weighted graph. We consider the task of completing a partially observed matrix network. We assume a novel sampling scheme where a fraction of matrices might be completely unobserved. How can we recover the entire matrix network from incomplete obse…
This work proposes a hybrid method for error detection in noisy Knowledge Graphs.
problem Error detection in noisy Knowledge Graphs.
method Hybrid and modular approach combining path ranking and representation learning.
result Hybrid method outperforms individual methods on benchmarks and real-world dataset.
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.
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.
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.
A fast, non-iterative method for missing value imputation using random trees.
problem Missing value imputation in large and high-dimensional datasets.
method Recursive semi-random hyperplane cuts to assign observations to buckets and calculate weighted averages as imputations.
result Significantly faster than chained equations and scales well to large datasets.
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.
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.
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.
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.
Simplicial neural networks extend graph neural networks to handle higher-order interactions.
problem Handling higher-order interactions in complex data structures.
method Define a convolution operation for simplicial complexes and use it to construct convolutional neural networks.
result SNNs effectively impute missing data in coauthorship complexes.
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…
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.
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.
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.
Proposes a new imputation method using autoencoders and feedback mechanisms.
problem Missing data undermines the performance of downstream data products.
method Multiple Imputation with Denoising Autoencoders and Metamorphic Truth/Imputation Feedback.
result Outperforms other methods in various missingness mechanisms and data patterns.