Paper proposes a new method to handle missing data in medical records using sequential variational autoencoders.
problem Missing data in medical records due to sensor off-times and uneven data collection.
method Sequential variational autoencoders (VAEs) with a new methodology called Shi-VAE.
result Shi-VAE achieves the best performance in terms of both metrics compared to state-of-the-art methods.
Despite the robust structure of the Internet, it is still susceptible to disruptive routing updates that prevent network traffic from reaching its destination. Our research shows that BGP announcements that are associated with disruptive updates tend to occur in groups of relatively high frequency, followed by periods …
Paper proposes using CNN for stock trading with data normalization.
problem Improving stock trading accuracy in volatile markets.
method Developed CNN-based trading framework with novel data normalization.
result CNN-based framework outperforms other methods on 29 stocks.
We investigate large changes, bursts, of the continuous stochastic signals, when the exponent of multiplicativity is higher than one. Earlier we have proposed a general nonlinear stochastic model which can be transformed into Bessel process with known first hitting (first passage) time statistics. Using these results w…
Proposes a new model to better handle overdispersed count time series.
problem Heterogeneous overdispersed count time series.
method Negative-Binomial Randomized Gamma Markov Process.
result Significantly improves predictive performance and fast convergence of inference algorithm.
Paper proves EM algorithm convergence for mixtures of discrete and continuous parameters.
problem Nontrivial convergence analysis for EM algorithms with mixed-integer parameters.
method Introduces conditions for EM convergence in mixed-integer optimization.
result Proves convergence of EM-based sparse Bayesian learning algorithm.
Improved error correction using neural networks and belief propagation.
problem Inference in factor graphs with loops or poor approximations.
method Hybrid model combining FG-GNN and belief propagation.
result Hybrid model outperforms belief propagation in error correction tasks.
The episodic, irregular and asynchronous nature of medical data render them difficult substrates for standard machine learning algorithms. We would like to abstract away this difficulty for the class of time-stamped categorical variables (or events) by modeling them as a renewal process and inferring a probability dens…
Hybrid model improves geopolitical conflict forecasting.
problem Forecasting geopolitical events from sparse, bursty data.
method Sparse Temporal Fusion Transformer (TFT) + Variational Nearest Neighbor Gaussian Process (VNNGP).
result Consistently outperforms standalone TFT in long-range horizons.
The problem to accurately and parsimoniously characterize random series of events (RSEs) present in the Web, such as e-mail conversations or Twitter hashtags, is not trivial. Reports found in the literature reveal two apparent conflicting visions of how RSEs should be modeled. From one side, the Poissonian processes, o…
Combustion reaction kinetics models are used for the description of a special class of bursty Financial Time Series. The small number of parameters they depend upon enable financial analysts to predict the time as well as the magnitude of the jump of the value of the portfolio. Several Financial Time Series are analyse…
We present a new, efficient method for automatically detecting severe conflicts `edit wars' in Wikipedia and evaluate this method on six different language WPs. We discuss how the number of edits, reverts, the length of discussions, the burstiness of edits and reverts deviate in such pages from those following the gene…
A common approach to analyze a covariate-sample count matrix, an element of which represents how many times a covariate appears in a sample, is to factorize it under the Poisson likelihood. We show its limitation in capturing the tendency for a covariate present in a sample to both repeat itself and excite related ones…
An accurate and fast estimation of the available bandwidth in a network with varying cross-traffic is a challenging task. The accepted probing tools, based on the fluid-flow model of a bottleneck link with first-in, first-out multiplexing, estimate the available bandwidth by measuring packet dispersions. The estimation…
Robust Bayesian models are appealing alternatives to standard models, providing protection from data that contains outliers or other departures from the model assumptions. Historically, robust models were mostly developed on a case-by-case basis; examples include robust linear regression, robust mixture models, and bur…
Study on missing data mechanisms and simple imputation methods in fairness of machine learning algorithms.
problem Impact of missing data mechanisms and simple imputation methods on fairness of machine learning algorithms.
method Three popular datasets for classification fairness were used. Missing values were generated using three missing data mechanisms. Various missing data handling techniques (listwise deletion, mean imputation, mode imputation, multiple imputation) were applied to the datasets. Fairness was assessed using classification algorithms (random forests).
result Missing data mechanism does not significantly impact fairness; listwise deletion gives highest fairness on average.
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…
Develops a VAE model for datasets with missing data.
problem Applying VAEs to datasets with missing data.
method A novel latent variable model of a corruption process generating missing data, with a tractable ELBO.
result Improved marginal log-likelihood and better missing data imputation compared to existing approaches.
Autoencoder neural network is implemented to estimate the missing data. Genetic algorithm is implemented for network optimization and estimating the missing data. Missing data is treated as Missing At Random mechanism by implementing maximum likelihood algorithm. The network performance is determined by calculating the…
New algorithms handle missing data to improve fairness in machine learning.
problem Missing values in data can lead to unfair outcomes in machine learning models.
method Developed scalable and adaptive algorithms to handle missing values while preserving predictive information.
result Our adaptive algorithms consistently achieve higher fairness and accuracy than standard impute-then-classify methods.
Trinary decision tree improves handling of missing data in machine learning.
problem Improving accuracy in decision tree algorithms when dealing with missing data.
method Introduces Trinary decision tree, which does not assume missing values contain information about the response.
result Trinary decision tree outperforms other algorithms in Missing Completely at Random settings, especially when data is only missing out-of-sample.
We present a scalable and robust Bayesian inference method for linear state space models. The method is applied to demand forecasting in the context of a large e-commerce platform, paying special attention to intermittent and bursty target statistics. Inference is approximated by the Newton-Raphson algorithm, reduced t…
DeepIFSAC uses attention mechanisms and contrastive learning to impute missing values in tabular data.
problem Missing values in tabular data, especially when high and not random.
method Row and column attention in a contrastive learning framework with CutMix data augmentation.
result Proposed method outperforms state-of-the-art methods for missing rates between 10% and 90% and various missing value types.
This paper compares imputation and direct parameter estimation methods for missing data in correlation matrix visualization.
problem Missing data challenges in estimating correlation coefficients for accurate visualization.
method Comparison of imputation and direct parameter estimation methods for handling missing data.
result Direct parameter estimation (DPER) outperforms imputation for accurate correlation matrix visualization.
This tutorial covers methods for handling missing data in SP and ML.
problem Dealing with missing data in signal processing and machine learning.
method Grouping strategies into three tasks: imputation, estimation, and prediction.
result Promising and future research directions are discussed.
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 enhances privacy in differential privacy.
problem Privacy preservation in datasets with missing values.
method Formalized missing data as a privacy amplification mechanism within differential privacy.
result Incomplete data can yield privacy amplification for differentially private algorithms.
The paper explores how missing data problems are related to causal inference.
problem Missing data in experiments makes causal inference difficult.
method The paper reinterprets missing data as a form of causal inference by considering counterfactual variables.
result Identification assumptions in missing data can be encoded using graphical models of counterfactual and observed variables.
We present an automatic classification method for astronomical catalogs with missing data. We use Bayesian networks, a probabilistic graphical model, that allows us to perform inference to pre- dict missing values given observed data and dependency relationships between variables. To learn a Bayesian network from incom…
A novel sequence-to-sequence model predicts missing sensor data.
problem Missing sensor data in sequences.
method Formulated a novel sequence-to-sequence model using forward and backward RNNs.
result The model produces the lowest errors in 12% more cases than the current state-of-the-art.
MIM adds indicator variables to improve model performance on incomplete data.
problem Missing data in incomplete data sets.
method Missing Indicator Method (MIM) and Selective MIM (SMIM).
result MIM improves model performance for informative missing values and high-dimensional data.
ELMV uses ensemble learning to handle missing values in EHR data.
problem Significant missing values in EHR data cause bias and unreliable conclusions.
method ELMV constructs multiple subsets with lower missing rates and uses a support set for ensemble learning.
result ELMV outperforms conventional methods in critical feature identification and outcome prediction.
Robust variable selection for high-dimensional data with missing and measurement errors.
problem Missing data and measurement errors confound data distribution.
method Exponential loss function with inverse probability weighting and additive error models.
result The Atan punishment method improves robust variable selection.
Two methods use BART to model missing data in leaf photosynthetic trait data.
problem Handling missing data in multivariate outcomes with non-ignorable mechanisms.
method Bayesian Additive Regression Trees (BART) for joint modeling of data and missingness indicators.
result Both methods effectively recover various missingness mechanisms and outperform existing approaches.
Gaussian Processes improve missing value imputation in datasets.
problem Handling missing values in large datasets.
method Sparse Gaussian Processes combined with stochastic variational inference.
result MGP significantly outperforms other imputation methods.
Sparse regression such as the Lasso has achieved great success in handling high-dimensional data. However, one of the biggest practical problems is that high-dimensional data often contain large amounts of missing values. Convex Conditioned Lasso (CoCoLasso) has been proposed for dealing with high-dimensional data with…
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.
Count data are often used in recommender systems: they are widespread (song play counts, product purchases, clicks on web pages) and can reveal user preference without any explicit rating from the user. Such data are known to be sparse, over-dispersed and bursty, which makes their direct use in recommender systems chal…
Paper explores Bayes rule for Gaussian mixtures with missing data, outperforming supervised classifiers.
problem Improving classification accuracy in partially classified samples with missing data.
method Generative model framework with missing-data mechanism, Bayes rule allocation.
result Bayes rule classifier with missing-data mechanism outperforms fully supervised classifiers in various conditions.
Proposes methods to handle missing data in clustering models.
problem Missing data, especially MNAR, hinders model-based clustering.
method Developed a mixture model for different types of data, including MNAR, using Expectation Maximization algorithm.
result The proposed MNARz model simplifies inference and enables clustering with MNAR data.
DIVE learns video representations even with missing data.
problem Missing data in video sequences.
method Disentangled Imputed Video autoEncoder (DIVE) with missingness latent variable.
result DIVE outperforms state-of-the-art baselines in imputing and predicting missing video frames.
Deep learning for missing data with flexible modelling.
problem Missing data with missingness dependent on the missing values.
method Deep latent variable models with a neural network for missingness pattern modeling, importance-weighted variational inference, and stochastic gradients.
result Explicitly modelling missingness improves inference on various data sets.
Two new methods improve clustering with missing data.
problem Handling missing data in Gaussian Mixture Models.
method Proposes two methods using Monte Carlo Expectation-Maximization (MCEM) for data augmentation.
result Proposed methods outperform multiple imputation in clustering and density estimation.
BlockEcho method improves imputation of block-wise missing data.
problem Block-wise missing data reduces interpolation capability and predictive power.
method Integrates Matrix Factorization (MF) within Generative Adversarial Networks (GAN) to retain long-distance inter-element relationships.
result Superior performance on public datasets across three domains, especially at higher missing rates.
Framework improves PV forecasting by accounting for missing data uncertainty.
problem Uncertainty from missing data in PV power data.
method Combines stochastic multiple imputation with Rubin's rule.
result Improves prediction interval calibration without sacrificing point prediction accuracy.
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.
Paper develops adaptive models for robust energy forecasting with missing data.
problem Operational models assume complete data; missing data can degrade forecast accuracy.
method Adaptive robust optimization and adversarial machine learning for missing data.
result Proposed models perform well even with short-term missing data and significantly outperform imputation with longer-term missing data.
Study compares traditional and machine learning methods for handling missing data in longitudinal studies.
problem Handling missing Not at Random (MNAR) and nonnormal data in longitudinal research.
method Monte Carlo simulations to assess six missing data techniques.
result FIML is most effective for MNAR data, while TSRE excels for MAR data.