a unified permutation test procedure to select and test at the same time the selected tree
best.tree.permute(xtree, xdata, Y.name, X.names, G.names, B = 10,
args.rpart = list(cp = 0, minbucket = 20, maxdepth = 10), epsi = 0.001,
iterMax = 5, iterMin = 3, family = "binomial", LEVEL = 0.05,
LB = FALSE, args.parallel = list(numWorkers = 1, type = "PSOCK"), verbose = TRUE)a list with six elements:
the adjusted p-value of the selected tree
a list with the fit of the selected pltr model fit_glm, the selected tree tree and the p-value of the selected tree without adjusting for multiple comparisons p.value
the fitted pltr model under the null hypothesis if the test is not significant
The execution time of the permutation test procedure
The P-values of the competing trees
The number of samples used inside the procedure
the maximal tree obtained by the function pltr.glm
the data frame used to build xtree
the name of the dependent variable
the names of independent variables to consider in the linear part of the glm. For this function, only a binary variable is supported.
the names of independent variables to consider in the tree part of the hybrid glm.
the size of the bootstrap sample
a list of options that control details of the rpart algorithm. minbucket: the minimum number of observations in any terminal <leaf> node; cp: complexity parameter (Any split that does not decrease the overall lack of fit by a factor of cp is not attempted); maxdepth: the maximum depth of any node of the final tree, with the root node counted as depth 0. ...
See rpart.control for further details
a treshold value to check the convergence of the algorithm
the maximal number of iteration to consider
the minimum number of iteration to consider
the binomial family.
the level of the test
a binary indicator with values TRUE or FALSE indicating weither the loading is balanced or not in the parallel computing. It is useless on a windows platform.
parameters of the parallelization. See mclapply for more details.
Logical; TRUE for printing progress during the computation (helpful for debugging)
Cyprien Mbogning
p.val.tree, best.tree.bootstrap