Description Usage Arguments Details Value References Examples
This function merges over-segmented intervals to create optimally pruned subtrees.
1 | prune(fulltree)
|
fulltree |
output from |
prune
uses the CART algorithm and -log (partial likelihood) as cost to find the optimally pruned subtrees.
prune
returns a matrix with the following columns, where each row is an optimally pruned subtree:
K |
subtrees number 1, 2, etc. Tree #1 is the full tree |
N[1] |
Number of terminal nodes |
alpha |
penalty parameter corresponding to the subtree |
S[1] |
-log(partial likelihood) of the subtree |
pruneoff |
Node that was removed from the previous larger subtree to obtain the current subtree |
Xu, R. and Adak, S. (2002), Survival Analysis with Time-Varying Regression Effects Using a Tree-Based Approach. Biometrics, 58: 305-315.
1 2 3 4 5 6 7 8 9 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.