Control arguments for DStree algorithm


Various paramters that control the specification of the DStree algorithm.


DStree.control(minsplit = 20L, minbucket = round(minsplit/3), cp = 0.005,
  maxcompete = 4L, maxdepth = 30, maxsurrogate = 0)



the minimum number of observations that must exist in a node in order for a split to be attempted.


the minimum number of observations in any terminal node. If only one of minbucket or minsplit is specified, the code either sets minsplit to minbucket*3 or minbucket to minsplit/3, as appropriate.


complexity parameter. Any split that does not decrease the overall lack of fit by a factor of cp is not attempted. This means that the overall deviance must decrease by cp at each step. The main role of this parameter is to save computing time by pruning off splits that are not worthwhile by definition. Essentially, the user informs the program that any split which does not improve the fit by cp will likely be pruned off.


the number of competitor splits retained in the output. It is useful to know not just which split was chosen, but which variable came in second, third, etc.


Set the maximum depth of any node of the final tree, with the root node counted as depth 0. Values greater than 30 DStree will give nonsense results on 32-bit machines.


the number of surrogate splits retained in the output. If this is set to zero the compute time will be reduced, since approximately half of the computational time (other than setup) is used in the search for surrogate splits.

comments powered by Disqus