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.
copied from cf-staging / r-fftrees| Label | Latest Version |
|---|---|
| main | 2.0.0 |
| gcc7 | 1.4.0 |
| cf201901 | 1.4.0 |
| cf202003 | 1.4.0 |
