fftrees_fitcomp

<code>fftrees_fitcomp</code> fits competitive algorithms for binary classification tasks
(e.g., LR, CART, RF, SVM) to the data and parameters specified in an <code>FFTrees</code> object.
<code>fftrees_fitcomp</code> is called by the main <code>FFTrees</code> function
when creating FFTs from and applying them to data (unless <code>do.comp = FALSE</code>).

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

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

Arguments

Fit competitive algorithms — fftrees_fitcomp

<dl>

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

</dl>

fftrees_fitcomp: Fit competitive algorithms

Description

Usage

Arguments

See Also