The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described by Phillips, Neth, Woike & Gaissmaier (2017), <doi:10.1017/S1930297500006239>. FFTs are simple and transparent decision trees for solving binary classification problems. FFTs can be preferable to more complex algorithms because they require very little information, are easy to understand and communicate, and are robust against overfitting.
Version: | 2.0.0 |
Depends: | R (≥ 3.5.0) |
Imports: | caret, rpart, randomForest, e1071, cli, dplyr, knitr, magrittr, scales, stringr, testthat, tibble, tidyselect |
Suggests: | rmarkdown, spelling |
Published: | 2023-06-05 |
DOI: | 10.32614/CRAN.package.FFTrees |
Author: | Nathaniel Phillips [aut], Hansjoerg Neth [aut, cre], Jan Woike [aut], Wolfgang Gaissmaier [aut] |
Maintainer: | Hansjoerg Neth <h.neth at uni.kn> |
BugReports: | https://github.com/ndphillips/FFTrees/issues |
License: | CC0 |
URL: | https://CRAN.R-project.org/package=FFTrees, https://github.com/ndphillips/FFTrees/ |
NeedsCompilation: | no |
Language: | en-US |
Citation: | FFTrees citation info |
Materials: | README NEWS |
CRAN checks: | FFTrees results |
Package source: | FFTrees_2.0.0.tar.gz |
Windows binaries: | r-devel: FFTrees_2.0.0.zip, r-release: FFTrees_2.0.0.zip, r-oldrel: FFTrees_2.0.0.zip |
macOS binaries: | r-release (arm64): FFTrees_2.0.0.tgz, r-oldrel (arm64): FFTrees_2.0.0.tgz, r-release (x86_64): FFTrees_2.0.0.tgz, r-oldrel (x86_64): FFTrees_2.0.0.tgz |
Old sources: | FFTrees archive |
Please use the canonical form https://CRAN.R-project.org/package=FFTrees to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.