Random forest missing data algorithms

By Fei Tang, Hemant Ishwaran. Statistical analysis and data mining, 2017

679 citations recorded by the source corpus.

Random forest (RF) missing data algorithms are an attractive approach for imputing missing data. They have the desirable properties of being able to handle mixed types of missing data, they are adaptive to interactions and nonlinearity, and they have the potential to scale to big data settings. Currently there are many different RF imputation algorithms, but relatively little guidance about their efficacy. Using a large, diverse collection of data sets, imputation performance of various RF algorithms was assessed under different missing data mechanisms. Algorithms included proximity imputation, on the fly imputation, and imputation utilizing multivariate unsupervised and supervised splitting—the latter class representing a generalization of a new promising imputation algorithm called missForest. Our findings reveal RF imputation to be generally robust with performance improving with increasing correlation. Performance was good under moderate to high missingness, and even (in certain cases) when data was missing not at random.

Subfields: Artificial Intelligence, Information Systems, Signal Processing

View Paper: https://www.semanticscholar.org/paper/db9924032f6d61bc649097f35b6729dbcbf1976b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Hemant Ishwaran
  2. Lancelot F. James
  3. Michael I. Jordan
  4. David B. Dunson
  5. Yee Whye Teh
  6. Lawrence Carin
  7. Mahmoud Zarepour
  8. Timothy E. Hanson

In Information Systems

  1. Hemant Ishwaran

In Signal Processing

  1. Hemant Ishwaran

Citations in the corpus