Create, visualize, and test fast-and-frugal decision trees (FFTs). FFTs are very simple decision trees for binary classification problems. FFTs can be preferable to more complex algorithms because they are easy to communicate, require very little information, and are robust against overfitting.
| Version: | 1.4.0 |
| Depends: | R (≥ 2.10) |
| Imports: | rpart, yarrr, circlize, parallel, graphics, randomForest, igraph, e1071, stringr, progress, pROC, caret |
| Suggests: | knitr, rmarkdown |
| Published: | 2018-09-15 |
| Author: | Nathaniel Phillips [aut, cre], Hansjoerg Neth [aut], Jan Woike [aut], Wolfgang Gaissmaer [aut] |
| Maintainer: | Nathaniel Phillips <Nathaniel.D.Phillips.is at gmail.com> |
| BugReports: | https://github.com/ndphillips/FFTrees/issues |
| License: | CC0 |
| NeedsCompilation: | no |
| Materials: | README |
| CRAN checks: | FFTrees results |
| Reference manual: | FFTrees.pdf |
| Vignettes: |
Accuracy Statistics FFTrees tree construction algorithms Examples of FFTrees Creating FFTrees with FFTrees() Creating FFTs for heart disease Manually specifying FFTs Visualizing FFTrees with plot() FFTrees package overview |
| Package source: | FFTrees_1.4.0.tar.gz |
| Windows binaries: | r-devel: FFTrees_1.4.0.zip, r-release: FFTrees_1.4.0.zip, r-oldrel: FFTrees_1.4.0.zip |
| OS X binaries: | r-release: FFTrees_1.3.5.tgz, r-oldrel: FFTrees_1.3.5.tgz |
| Old sources: | FFTrees archive |
| Reverse imports: | PCRedux |
Please use the canonical form https://CRAN.R-project.org/package=FFTrees to link to this page.