Effects of stopping criterion on the growth of trees in regression random forests.

ABSTRACT: Random forests are a powerful machine learning tool that capture complex relationships between independent variables and an outcome of interest. Trees built in a random forest are dependent on several hyperparameters, one of the more critical being the node size. The original algorithm of Breiman, controls for node size by limiting the size of the parent node, so that a node cannot be split if it has less than a specified number of observations. We propose that this hyperparameter should instead be defined as the minimum number of observations in each terminal node. The two existing random forest approaches are compared in the regression context based on estimated generalization error, bias-squared, and variance of resulting predictions in a number of simulated datasets. Additionally the t

SUBMITTER: Arsham A 

PROVIDER: S-EPMC10659741 | biostudies-literature | 2023 Apr

REPOSITORIES: biostudies-literature