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 Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=FFTrees 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