inwords

<code>inwords</code> generates and provides a verbal description
of a fast-and-frugal tree (FFT) from an <code>FFTrees</code> object.
When <code>data</code> remains unspecified, <code>inwords</code> will only look up <code>x$trees$inwords</code>.
When <code>data</code> is set to either "train" or "test", <code>inwords</code> first employs
<code>fftrees_ffttowords</code> to re-generate the verbal descriptions of FFTs in <code>x</code>.

Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described by Phillips, Neth, Woike & Gaissmaier (2017), <doi:10.1017/S1930297500006239>.
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 understand and communicate, and are robust against overfitting.

Hansjoerg Neth

FFTrees

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

Nathaniel Phillips

Jan Woike

Wolfgang Gaissmaier

inwords function

<dl><dt>x</dt>
<dd>An <code>FFTrees</code> object.</dd>
<dt>data</dt>
<dd>The type of data to which a tree is being applied (as character string "train" or "test").
Default: <code>data = NULL</code> will only look up <code>x$trees$inwords</code>.</dd>
<dt>tree</dt>
<dd>The tree to display (as an integer).</dd></dl>

Arguments

Provide a verbal description of an FFT — inwords

<dl>

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


<dt>data</dt>
<dd>The type of data to which a tree is being applied (as character string "train" or "test").
Default: <code>data = NULL</code> will only look up <code>x$trees$inwords</code>.</dd>


<dt>tree</dt>
<dd>The tree to display (as an integer).</dd>

</dl>

inwords: Provide a verbal description of an FFT

Description

Usage

Value

Arguments

See Also