TY - GEN
T1 - Optimized linear imputation
AU - Resheff, Yehezkel S.
AU - Weinshall, Daphna
N1 - Publisher Copyright: © 2017 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.
PY - 2017
Y1 - 2017
N2 - Often in real-world datasets, especially in high dimensional data, some feature values are missing. Since most data analysis and statistical methods do not handle gracefully missing values, the first step in the analysis requires the imputation of missing values. Indeed, there has been a long standing interest in methods for the imputation of missing values as a pre-processing step. One recent and effective approach, the IRMI stepwise regression imputation method, uses a linear regression model for each real-valued feature on the basis of all other features in the dataset. However, the proposed iterative formulation lacks convergence guarantee. Here we propose a closely related method, stated as a single optimization problem and a block coordinate-descent solution which is guaranteed to converge to a local minimum. Experiments show results on both synthetic and benchmark datasets, which are comparable to the results of the IRMI method whenever it converges. However, while in the set of experiments described here IRMI often diverges, the performance of our methods is shown to be markedly superior in comparison with other methods.
AB - Often in real-world datasets, especially in high dimensional data, some feature values are missing. Since most data analysis and statistical methods do not handle gracefully missing values, the first step in the analysis requires the imputation of missing values. Indeed, there has been a long standing interest in methods for the imputation of missing values as a pre-processing step. One recent and effective approach, the IRMI stepwise regression imputation method, uses a linear regression model for each real-valued feature on the basis of all other features in the dataset. However, the proposed iterative formulation lacks convergence guarantee. Here we propose a closely related method, stated as a single optimization problem and a block coordinate-descent solution which is guaranteed to converge to a local minimum. Experiments show results on both synthetic and benchmark datasets, which are comparable to the results of the IRMI method whenever it converges. However, while in the set of experiments described here IRMI often diverges, the performance of our methods is shown to be markedly superior in comparison with other methods.
KW - Imputation
UR - http://www.scopus.com/inward/record.url?scp=85048948128&partnerID=8YFLogxK
U2 - 10.5220/0006092900170025
DO - 10.5220/0006092900170025
M3 - منشور من مؤتمر
T3 - ICPRAM 2017 - Proceedings of the 6th International Conference on Pattern Recognition Applications and Methods
SP - 17
EP - 25
BT - ICPRAM 2017 - Proceedings of the 6th International Conference on Pattern Recognition Applications and Methods
A2 - De Marsico, Maria De
A2 - di Baja, Gabriella Sanniti
A2 - Fred, Ana
T2 - 6th International Conference on Pattern Recognition Applications and Methods, ICPRAM 2017
Y2 - 24 February 2017 through 26 February 2017
ER -