permuteFE | R Documentation |
A function returns the Q-between from the tree with given size
permuteFE(
mf,
Call,
nsplit,
P = 100,
sss,
lookahead,
minbucket = 3,
minsplit = 6,
cp = 1e-04,
maxdepth = 10,
alpha.endcut = 0.02,
a = 50,
multi.start = T,
n.starts = 3,
...
)
mf |
data transformed to fit the tree. |
Call |
The matched call. |
nsplit |
the required number of splits. |
P |
the number of permuted data sets. |
sss |
boolean indicating whether the SSS strategy is used or not. |
lookahead |
a boolean argument indicating whether to apply the "look-ahead" strategy when fitting the tree |
minbucket |
the minimum number of observations in any terminal <leaf> node. |
minsplit |
the minimum number of observations that must exist in a node in order for a split to be attempted. |
cp |
complexity parameter as in rpart. |
maxdepth |
set the maximum depth of any node of the final tree, with the root node counted as depth 0. |
alpha.endcut |
parameter used in the splitting algorithm to avoid the endcut preference problem. |
a |
parameter used in the sss to determine the slope of the logistic function that replaces the indicator function. |
multi.start |
boolean indicating whether multiple starts must be used |
n.starts |
number of multiple starts |
... |
Additional arguments passed to prune.rpart(). |
The pruned tree
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.