According to the obligatory rule, nodes with a lower frequency value are on the left. When the finished tree is generated, all edges should be labeled. The rule is to mark the left edge with the value 0 and the right edge with 1. The result is shown in Figure 6. Figure 6. The ...
For 𝑛n types, the height of the decision tree is 𝑛−1n−1. Put the classes that are easy to distinguish on the upper layer, and the classes that are difficult to distinguish on the lower layer. The schematic diagram of DAG method for five-class SVM is shown in Figure 7. ...