fftrees_define

<code>fftrees_define</code> creates definitions of fast-and-frugal trees
(FFTs, as an <code>FFTrees</code> object).
<code>fftrees_define</code> usually passes passes <code>x</code> either
to <code>fftrees_grow_fan</code> (to create new FFTs by applying algorithms to data) or
to <code>fftrees_wordstofftrees</code> (if <code>my.tree</code> is specified).
If <code>object</code> is provided, <code>fftrees_define</code> uses the trees from this <code>FFTrees</code> object.

internal

Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described in Phillips, Neth, Woike & Gaissmaier (2017).
FFTs are simple and transparent decision trees for solving binary classification problems.
FFTs can be preferable to more complex algorithms because they require very little information, are easy to communicate, and are robust against overfitting.

Hansjoerg Neth

FFTrees

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

Nathaniel Phillips

Jan Woike

Wolfgang Gaissmaier

fftrees_define function

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

Arguments

Create FFT definitions — fftrees_define

<dl>

<dt>x</dt>
<dd>An <code>FFTrees</code> object.</dd>


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

</dl>

fftrees_define: Create FFT definitions

Description

Usage

Value

Arguments

See Also