| PRTools contents |
TREE_MAP
F = TREE_MAP(A,W)
| Input | |
| A | Dataset |
| W | Decision tree mapping |
| Output | |
| F | Posterior probabilities |
Maps the dataset A by the binary decision tree classifier W on the [0,1] interval for each of the classes W is trained on. The posterior probabilities stored in F sum row-wise to one. W should be trained by a classifier like treec. This routine is called automatically to solve A*W if W is trained by treec.
| PRTools contents |