FFTrees2.0.0 package

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

add_fft_df

Add an FFT definition to tree definitions

add_nodes

Add nodes to an FFT definition

add_stats

Add decision statistics to data (based on frequency counts of a 2x2 cl...

classtable

Compute classification statistics for binary prediction and criterion ...

comp_pred

Fit and predict competing classification algorithms

describe_data

Describe data

drop_nodes

Drop a node from an FFT definition

edit_nodes

Edit nodes in an FFT definition

fact_clean

Clean factor variables in prediction data

FFTrees.guide

Open the FFTrees package guide

FFTrees

Main function to create and apply fast-and-frugal trees (FFTs)

fftrees_apply

Apply an FFT to data and generate accuracy statistics

fftrees_create

Create an object of class FFTrees

fftrees_cuerank

Calculate thresholds that optimize some statistic (goal) for cues in d...

fftrees_define

Create FFT definitions

fftrees_ffttowords

Describe a fast-and-frugal tree (FFT) in words

fftrees_fitcomp

Fit competitive algorithms

fftrees_grow_fan

Grow fast-and-frugal trees (FFTs) using the fan algorithms

fftrees_ranktrees

Rank FFTs by current goal

fftrees_threshold_factor_grid

Perform a grid search over factor and return accuracy statistics for a...

fftrees_threshold_numeric_grid

Perform a grid search over thresholds and return accuracy statistics f...

fftrees_wordstofftrees

Convert a verbal description of an FFT into an FFTrees object

flip_exits

Flip exits in an FFT definition

get_best_tree

Select the best tree (from current set of FFTs)

get_exit_type

Get exit type (from a vector x of FFT exit descriptions)

get_fft_df

Get FFT definitions (from an FFTrees object x)

heart.cost

Cue costs for the heartdisease data

heart.test

Heart disease testing data

heart.train

Heart disease training data

inwords

Provide a verbal description of an FFT

plot.FFTrees

Plot an FFTrees object

predict.FFTrees

Predict classification outcomes or probabilities from data

print.FFTrees

Print basic information of fast-and-frugal trees (FFTs)

read_fft_df

Read an FFT definition from tree definitions

reorder_nodes

Reorder nodes in an FFT definition

select_nodes

Select nodes from an FFT definition

showcues

Visualize cue accuracies (as points in ROC space)

summary.FFTrees

Summarize an FFTrees object

write_fft_df

Write an FFT definition to tree definitions

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.

  • Maintainer: Hansjoerg Neth
  • License: CC0
  • Last published: 2023-06-05