Fast implementation of random forests or recursive partitioning.
RangerModel(
num.trees = 500,
mtry = NULL,
importance = c("impurity", "impurity_corrected", "permutation"),
min.node.size = NULL,
replace = TRUE,
sample.fraction = ifelse(replace, 1, 0.632),
splitrule = NULL,
num.random.splits = 1,
alpha = 0.5,
minprop = 0.1,
split.select.weights = NULL,
always.split.variables = NULL,
respect.unordered.factors = NULL,
scale.permutation.importance = FALSE,
verbose = FALSE
)
number of trees.
number of variables to possibly split at in each node.
variable importance mode.
minimum node size.
logical indicating whether to sample with replacement.
fraction of observations to sample.
splitting rule.
number of random splits to consider for each
candidate splitting variable in the "extratrees"
rule.
significance threshold to allow splitting in the
"maxstat"
rule.
lower quantile of covariate distribution to be considered for
splitting in the "maxstat"
rule.
numeric vector with weights between 0 and 1, representing the probability to select variables for splitting.
character vector with variable names to be
always selected in addition to the mtry
variables tried for
splitting.
handling of unordered factor covariates.
scale permutation importance by standard error.
show computation status and estimated runtime.
MLModel
class object.
factor
, numeric
, Surv
mtry
, min.node.size
*, splitrule
*
* included only in randomly sampled grid points
Default values for the NULL
arguments and further model details can be
found in the source link below.
# NOT RUN {
## Requires prior installation of suggested package ranger to run
fit(Species ~ ., data = iris, model = RangerModel)
# }
# NOT RUN {
# }
Run the code above in your browser using DataLab