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 + file LICENSE NeedsCompilation: no Citation: BESTree citation info CRAN checks: BESTree results Documentation: Reference manual: BESTree.pdf Vignettes: How to use BEST ? (source, R code)Please use the canonical form https://CRAN.R-project.org/package=BESTree to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4