Case-Specific Random Forests
- 2 January 2016
- journal article
- machine learning
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 25 (1) , 49-65
Abstract
Random forest (RF) methodology is a nonparametric methodology for prediction problems. A standard way to use RFs includes generating a global RF to predict all test cases of interest. In this article, we propose growing different RFs specific to different test cases, namely case-specific random forests (CSRFs). In contrast to the bagging procedure in the building of standard RFs, the CSRF algorithm takes weighted bootstrap resamples to create individual trees, where we assign large weights to the training cases in close proximity to the test case of interest a priori. Tuning methods are discussed to avoid overfitting issues. Both simulation and real data examples show that the weighted bootstrap resampling used in CSRF construction can improve predictions for specific cases. We also propose a new case-specific variable importance (CSVI) measure as a way to compare the relative predictor variable importance for predicting a particular case. It is possible that the idea of building a predictor case-specifically can be generalized in other areas.Keywords
This publication has 6 references indexed in Scilit:
- Multivariate random forestsWIREs Data Mining and Knowledge Discovery, 2011
- Random survival forestsThe Annals of Applied Statistics, 2008
- Enriched random forestsBioinformatics, 2008
- Random ForestsMachine Learning, 2001
- Statistical Modeling: The Two Cultures (with comments and a rejoinder by the author)Statistical Science, 2001
- Bagging predictorsMachine Learning, 1996