Compstat 2000
DOI: 10.1007/978-3-642-57678-2_19
|View full text |Cite
|
Sign up to set email alerts
|

Tree-based algorithms for missing data imputation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…Furthermore, they produce partitions that can be represented graphically. CART methods have been used for imputation in a number of different scenarios (see Barcena & Tusell, ; Conversano & Cappelli, ; Harrell, ; Vateekul & Sarinnapakorn, , among others). van Buuren () outline the steps in a CART based imputation algorithm.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, they produce partitions that can be represented graphically. CART methods have been used for imputation in a number of different scenarios (see Barcena & Tusell, ; Conversano & Cappelli, ; Harrell, ; Vateekul & Sarinnapakorn, , among others). van Buuren () outline the steps in a CART based imputation algorithm.…”
Section: Methodsmentioning
confidence: 99%
“…Therefore, they could still distort the distribution of the observed data. PMM is a hot-deck method that replaces the missing values with observed measurements, rather than conditional means (Andridge & Little, 2010;Ford, 1983 CART methods have been used for imputation in a number of different scenarios (see Barcena & Tusell, 2000;Conversano & Cappelli, 2002;Harrell, 2001;Vateekul & Sarinnapakorn, 2009, among others). van Buuren (2012) outline the steps in a CART based imputation algorithm.…”
Section: Regression-based Imputation Procedures Replace Missing Valuesmentioning
confidence: 99%
“…Other missing data mechanisms are respectively Missing Completely at Random, when missingness does not depend on observed and/or missing values in the data matrix, and Not Missing at Random, when given the observed data, the distribution of missing data indicator matrix still depends on the missing values. There are several approaches to deal with missingness (Little and Rubin 1987;McKnight, McKnight, Sidani and Figueredo 2007): ignoring and deleting data (i.e., Listwise deletion and Discarding instances), availablecase methods (i.e., pairwise delection), non-model based imputation procedures (i.e., unconditional mean imputation, conditional mean imputation), model-based imputation procedures, either implicit models, founded on implicit assumptions on the proximity between individuals belonging to the data set (i.e., hot deck imputation, cold deck imputation, substitution method, composite methods (Sande 1983;Ford 1983;David, Little, Samuel and Triest 1986)), or explicit models, based on a statistical model to describe the predictive distribution of missing data, i.e., linear regression, logistic regression (Little 1992;Ibrahim 1990;Ibrahim, Lipsitz and Chen 1999), multiple imputation methods (Rubin 1987), EM algorithm (Dempster, Laird and Rubin 1977), distribution free methods such as non parametric regression (Chu and Cheng 1995) and tree-based methods (Lakshminarayan, Harp, Goldman and Samad 1996;Barcena and Tusell 2000;Conversano 2002, 2008;Conversano and Siciliano 2009). …”
Section: Missing Datamentioning
confidence: 99%
“…Naturally, the machine learning community was also first to employ CART and RF predictions for treating missing values as part of a conditional mean imputation procedure (Bárcena & Tusell, 2000;Conversano & Cappelli, 2002;Conversano & Siciliano, 2009;Creel & Krotki, 2006;D'Ambrosio, Aria, & Siciliano, 2012;Ishwaran, Kogalur, Blackstone, & Lauer, 2008;Stekhoven & Bühlmann, 2011 (Jacobucci, Grimm, & McArdle, 2017;Morgan & Sonquist, 1963;Strobl et al, 2009).…”
Section: Conditional Mean Imputation By Recursive Partitioning Predicmentioning
confidence: 99%