From: Michael Schwartz on 20 Apr 2010 15:45 I was wondering if anyone knew how the TreeBagger handles missing values. There seem to be two methods described in literature and by Breiman. One of these (apparently, the better one) uses a recursive/iterative method for computing the missing value. Does anyone know (for certain) which method is implemented? There are no options available for setting this. I've tried to look through the code, but can't figure out where this is handled and how it is handled. Thanks. -mike-
|
Pages: 1 Prev: Trouble with textscan Next: Reading mat file in C++ (VS) |