3 ms·
If anyone is particularly interested, there are notes on the original RandomForest implementation, by Breiman and Cutler, which describe how missing values are
by shoo 12y ago
If anyone is particularly interested, there are notes on the original RandomForest implementation, by Breiman and Cutler, which describe how missing values are handled (as well as a great deal of other interesting tricks!):
https://www.stat.berkeley.edu/~breiman/RandomForests/cc_home.htm#missing1 https://www.stat.berkeley.edu/~breiman/RandomForests/cc_home...
- micro_cam 12y agoThere are some other ways an rf can be made to handle missing values including splitting the values onto a third branch at each node (which can be useful if the fact the value is missing may be informative), just leaving the missing values out at each split and applying a bias correction (as was common with pre rf decision trees), or doing a local imputation within the in branch cases at each node.