Fig. 8

Rule extraction from a decision tree. Starting at the root of a tree, the first decision rule is extracted (labeled ‘1’). The algorithm moves one level deeper in the tree and combines the first rule with each of the nodes at the current level to create new extracted rules. These steps are repeated until a leaf is reached and all paths from root to leaves have been traversed. Individual decision rules are denoted as yellow nodes. Leaves are blue and red circles, denoting a binary outcome. Each extracted rule is numbered and consists of the combination of rules along its path