.png){kind=icon}
返回
Autoreplicative random forests with applications to missing value imputation
.png){kind=icon}
PRE
AI
DOI：10.1007/s10994-024-06584-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Missing values are a common problem in data science and machine learning. Removing instances with missing values is a straightforward workaround, but this can significantly hinder subsequent data analysis, particularly when features outnumber instances. There are a variety of methodologies proposed in the literature for imputing missing values. Denoising Autoencoders, for example, have been leveraged efficiently for imputation. However, neural network approaches have been relatively less effective on smaller datasets. In this work, we propose Autoreplicative Random Forests (ARF) as a multi-output learning approach, which we introduce in the context of a framework that may impute via either an iterative or procedural process. Experiments on several low- and high-dimensional datasets show that ARF is computationally efficient and exhibits better imputation performance than its competitors, including neural network approaches. In order to provide statistical analysis and mathematical background to the proposed missing value imputation framework, we also propose probabilistic ARFs, where the confidence values are provided over different imputation hypotheses, therefore maximizing the utility of such a framework in a machine-learning pipeline targeting predictive performance.
Keyword:
Multi-label classification
Multi-output modeling
Missing value imputation
Probabilistic inference
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
.png){kind=icon}
分享收藏Missing data imputation using an iterative denoising autoencoder (IDAE) for dissolved gas analysis使用迭代降噪自动编码器 (IDAE) 进行溶解气体分析的缺失数据插补
PREAI
分享收藏
查看更多内容