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.
|Author||Nathaniel Phillips [aut, cre], Hansjoerg Neth [aut], Jan Woike [aut], Wolfgang Gaissmaer [aut]|
|Date of publication||2017-07-11 10:31:35 UTC|
|Maintainer||Nathaniel Phillips <Nathaniel.D.Phillips.firstname.lastname@example.org>|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.