heart.cost

<p>This data further characterizes the variables (cues) in the <code>heartdisease</code> dataset.</p>

datasets

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

heart.cost function

<p>A list of length 13 containing the cost of each cue in the <code>heartdisease</code> dataset (in dollars).
Each list element is a single (positive numeric) value.</p>

Format

Cue costs for the heartdisease data — heart.cost

Cue costs for the heartdisease data

heart.cost: Cue costs for the heartdisease data

Description

Usage

Arguments

Format

See Also