Consider the example, number of corrected mis – classifications at a particular node, n'(t) = 15.5, and number of corrected mis – classifications for sub – tree, n'(Tt) = 12. N(t) is the number of training set examples at node t and it is equal to 35. Here the tree should be pruned.

🎲 Try a Random Question  |  Total Questions in Quiz: 90  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Machine Learning 101 Practice Test: Decision Trees — practice the complete quiz, review flashcards, or try a random question.

Quiz on important decision trees concepts including decision tree pruning, inductive bias, classification trees, regression trees, and the powerful Random Forest algorithm.   Decision trees are a type of machine learning algorithm that split a dataset based on specific parameters until a final decision is made. They are one of the most easily explainable types of machine learning models.  Here are some basics about decision trees: Pruning: A technique that simplifies decision trees by reducing the rules. This helps to avoid complexity and improves accuracy. Splitting: Decision trees... Show more

Consider the example, number of corrected mis – classifications at a particular node, n'(t) = 15.5, and number of corrected mis – classifications for sub – tree, n'(T<sub>t</sub>) = 12. N(t) is the number of training set examples at node t and it is equal to 35. Here the tree should be pruned.