003)</span> is a set of
hierarchical rules for solving binary classification tasks based on very
little pieces of information (usually using 4 or fewer cues). In
contrast to more complex decision trees, each node of an FFT has exactly
two branches. A branch can either contain another cue (i.e., ask another
question) or lead to an exit (i.e., yield a decision or prediction
outcome).<br>
Each non-final node of an FFT has one exit branch and the final node has
two exit branches.</p>
<!-- Characteristics and