Abstract
In real-world problems, data are generally characterized by their imperfection. One of the most common forms of imperfection is missing data. In fact, dealing with missing data remains a very important issue in data mining and knowledge discovery researches. A panoply of methods, addressing this problem, is proposed in the literature handling different types of data. In this work, we focus our study towards three methods which are KNN, MissForest, and EM algorithm. These methods are considered among the most efficient in different imputation problems. In the first part of this work, we present a brief state of the art of the used imputation methods and the strategy that we propose to use. In the second part, we provide a comparative study based on different criterion showing the efficiency of MissForest compared to the other methods and we demonstrate that the combination is preferable to improve the imputation of continuous data instead of using them individually.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Afshari Safavi, A., Kazemzadeh Gharechobogh, H., Rezaei, M.: Comparison Of EM algorithm and standard imputation methods for missing data: a questionnaire study on diabetic patients. Iran. J. Epidemiol. 11(3), 43–51 (2015)
Batista, G.E., Monard, M.C.: A study of K-Nearest neighbour as an imputation method. HIS 87(251–260), 48 (2002)
Breiman, L.: Random forests. Mach. Learn. 45(1), 5–32 (2001)
Chen, J., Shao, J.: Nearest neighbor imputation for survey data. J. Official Stat. 16(2), 113 (2000)
Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B (Meth.) 39, 1–38 (1977)
Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases. University of California, Irvine, Department of Information and Computer Science (1998). http://www.ics.uci.edu/~mlearn/MLRepository.html
Oba, S., Sato, M.A., Takemasa, I., Monden, M., Matsubara, K.I., Ishii, S.: A Bayesian missing value estimation method for gene expression profile data. Bioinformatics 19(16), 2088–2096 (2003)
Penone, C., Davidson, A.D., Shoemaker, K.T., Di Marco, M., Rondinini, C., Brooks, T.M., Young, B.E., Graham, C.H., Costa, G.C.: Imputation of missing data in life-history traits datasets: which approach performs the best? Meth. Ecol. Evol. 5, 961–970 (2014)
Rubin, D.B.: Basic ideas of multiple imputation for nonresponse. Surv. Methodol. 12(1), 37–47 (1986)
Rubin, D.B., Little, R.J.: Statistical Analysis with Missing Data. Wiley, Hoboken (2002)
Shipp, C.A., Kuncheva, L.I.: Relationships between combination methods and measures of diversity in combining classifiers. Inf. Fusion 3(2), 135–148 (2002)
Stdler, N., Bühlmann, P.: Pattern alternating maximization algorithm for high-dimensional missing data. Arxiv preprint arXiv, 1005 (2010)
Stekhoven, D.J., Bühlmann, P.: MissForestnon-parametric missing value imputation for mixed-type data. Bioinformatics 28(1), 112–118 (2012)
Troyanskaya, O., Cantor, M., Sherlock, G., Brown, P., Hastie, T., Tibshirani, R., Botstein, D., Altman, R.B.: Missing value estimation methods for DNA microarrays. Bioinformatics 17(6), 520–525 (2001)
Zhu, X.P.: Comparison of four methods for handing missing data in longitudinal data analysis through a simulation study. Open J. Stat. 4(11), 933 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ben Hariz, N., Khoufi, H., Zagrouba, E. (2017). On Combining Imputation Methods for Handling Missing Data. In: Benferhat, S., Tabia, K., Ali, M. (eds) Advances in Artificial Intelligence: From Theory to Practice. IEA/AIE 2017. Lecture Notes in Computer Science(), vol 10350. Springer, Cham. https://doi.org/10.1007/978-3-319-60042-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-60042-0_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60041-3
Online ISBN: 978-3-319-60042-0
eBook Packages: Computer ScienceComputer Science (R0)