Description Usage Arguments Value Author(s) See Also Examples
Evaluation trees are trees which are implemented with "left" and "right" pointers. We transform this tree representation to the representation with "parent" pointers (level set tree), so that it can be plotted with the "plottree" function of package "denpro". For example, functions "densplit" and "eval.pick" return evaluation trees.
1 | lefrig2par(et)
|
et |
evaluation tree; result of "densplit", "eval.pick", "eval.cart", ...; see the documentation of "eval.cart" |
Returns a level set tree:
parent |
parent links |
level |
height of the node |
center |
determines the ordering of the nodes |
volume |
determines the horizontal positioning of the nodes |
Jussi Klemela
1 2 3 4 5 6 7 | library(denpro)
dendat<-sim.data(n=100,seed=5,type="mulmodII")
et<-densplit(dendat)
lst<-lefrig2par(et)
plottree(lst)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.