fftrees_wordstofftrees

Converts text describing an FFT into an FFT definition.

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_wordstofftrees function

<dl><dt>x</dt>
<dd>FFTrees.</dd>
<dt>my.tree</dt>
<dd>string. A string defining an FFT</dd></dl>

Arguments

Converts text describing an FFT into an FFT definition. — fftrees_wordstofftrees

<dl>

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


<dt>my.tree</dt>
<dd>string. A string defining an FFT</dd>

</dl>

fftrees_wordstofftrees: Converts text describing an FFT into an FFT definition.

Description

Usage

Value

Arguments