Calculates a CART histogram. The estimate is represented as an evaluation tree. An CART histogram is a multivariate adaptive histogram which is obtained by pruning an evaluation tree of an overfitting histogram.

1 |

`dendat` |
n*d data matrix |

`leaf` |
positive integer; the cardinality of the partition of the histogram |

`minobs` |
non-negative integer; splitting of a bin of the overfitting histogram will be continued if the bin containes "minobs" or more observations |

The partition of the histogram may not contain exactly "leaf" rectangles: the cardinality of the partition is as close as possible to "leaf"

An evaluation tree

Jussi Klemela

1 2 3 4 5 6 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.