fftrees_define

internal

Create, visualize, and test fast-and-frugal decision trees (FFTs) using methods described in Phillips, Neth, Woike & Gaissmaier. (2017). 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.

Nathaniel Phillips

FFTrees

Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees

Hansjoerg Neth

Jan Woike

Wolfgang Gaissmaer

fftrees_define function

<dl><dt>x</dt>
<dd>FFTrees.</dd>
<dt>object</dt>
<dd>FFTrees.</dd></dl>

Arguments

Create definitions of FFTrees — fftrees_define

<dl>

<dt>x</dt>
<dd>FFTrees.</dd>


<dt>object</dt>
<dd>FFTrees.</dd>

</dl>

Create definitions of FFTrees

fftrees_define: Create definitions of FFTrees

Description

Usage

Value

Arguments