Introduction to Stopping Conditions
Part B: Stopping Conditions Introduction In the preceding section, we introduced an algorithm designed to construct a decision tree. This algorithm incorporates a specific feature known as a stopping condition. Question: Question: If we don’t terminate the decision tree algorithm manually, what will the leaf nodes of the decision tree look like? Show Answer Answer: The tree will continue to grow until each leaf node contains exactly one training point and the model attains 100% training accuracy. As you might remember from our previous course, 100% accuracy is a bad thing! It almost certainly means that we have overfit our data. Question: Question: How can we prevent this from happening? Show Answer Answer: Stop the tree from growing. Common Stopping Conditions The most common stopping criterion involves restricting the maximum depth ( max_depth ) of the tree. The following diagram illustrates a decision tree ...