fftrees_ffttowords

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

<dl><dt>x</dt>
<dd>FFTrees. An FFTrees object created with FFTrees()</dd>
<dt>digits</dt>
<dd>integer. How many digits to round numeric values</dd></dl>

Arguments

Describes an FFT in words — fftrees_ffttowords

<dl>

<dt>x</dt>
<dd>FFTrees. An FFTrees object created with FFTrees()</dd>


<dt>digits</dt>
<dd>integer. How many digits to round numeric values</dd>

</dl>

fftrees_ffttowords: Describes an FFT in words

Description

Usage

Value

Arguments

Examples