Decision tree algorithm with a major feature added. Allows for users to define an ordering on the partitioning process. Resulting in Branch-Exclusive Splits Trees (BEST). Cedric Beaulac and Jeffrey S. Rosentahl (2019) <doi:10.48550/arXiv.1804.10168>.
| Version: | 0.5.2 |
| Depends: | R (≥ 2.10) |
| Imports: | plyr, compiler, utils, stats |
| Suggests: | knitr,rmarkdown,testthat |
| Published: | 2019-08-09 |
| DOI: | 10.32614/CRAN.package.BESTree |
| Author: | Beaulac Cedric [aut, cre] |
| Maintainer: | Beaulac Cedric <cedric at utstat.toronto.edu> |
| License: | MIT + fileLICENSE |
| NeedsCompilation: | no |
| Citation: | BESTree citation info |
| CRAN checks: | BESTree results |
| Reference manual: | BESTree.html ,BESTree.pdf |
| Vignettes: | How to use BEST ? (source,R code) |
| Package source: | BESTree_0.5.2.tar.gz |
| Windows binaries: | r-devel:BESTree_0.5.2.zip, r-release:BESTree_0.5.2.zip, r-oldrel:BESTree_0.5.2.zip |
| macOS binaries: | r-release (arm64):BESTree_0.5.2.tgz, r-oldrel (arm64):BESTree_0.5.2.tgz, r-release (x86_64):BESTree_0.5.2.tgz, r-oldrel (x86_64):BESTree_0.5.2.tgz |
Please use the canonical formhttps://CRAN.R-project.org/package=BESTreeto link to this page.