permuteRE: Permutation test
In metacart: Meta-CART: A Flexible Approach to Identify Moderators in Meta-Analysis

permuteRE

R Documentation

Permutation test

Description

Perform permutation test for an RE-tree

Usage

permuteRE(
  mf,
  nsplit,
  P = 999,
  sss,
  lookahead,
  minbucket = 3,
  minsplit = 6,
  cp = 1e-04,
  alpha.endcut = 0.02,
  a = 50,
  multi.start = T,
  n.starts = 3
)

Arguments

`mf`	the data object of the RE-tree
`nsplit`	the number of splits in the RE-tree
`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.
`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