Description Usage Arguments Details Value See Also Examples
View source: R/ML_AdaBagModel.R
Fits the Bagging algorithm proposed by Breiman in 1996 using classification trees as single classifiers.
1 2 3 4 5 6 7 8 9 10 11 12  AdaBagModel(
mfinal = 100,
minsplit = 20,
minbucket = round(minsplit/3),
cp = 0.01,
maxcompete = 4,
maxsurrogate = 5,
usesurrogate = 2,
xval = 10,
surrogatestyle = 0,
maxdepth = 30
)

mfinal 
number of trees to use. 
minsplit 
minimum number of observations that must exist in a node in order for a split to be attempted. 
minbucket 
minimum number of observations in any terminal node. 
cp 
complexity parameter. 
maxcompete 
number of competitor splits retained in the output. 
maxsurrogate 
number of surrogate splits retained in the output. 
usesurrogate 
how to use surrogates in the splitting process. 
xval 
number of crossvalidations. 
surrogatestyle 
controls the selection of a best surrogate. 
maxdepth 
maximum depth of any node of the final tree, with the root node counted as depth 0. 
factor
mfinal
, maxdepth
Further model details can be found in the source link below.
MLModel
class object.
1 2 3  ## Requires prior installation of suggested package adabag to run
fit(Species ~ ., data = iris, model = AdaBagModel(mfinal = 5))

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.