In a decision tree, what does a leaf node represent? A splitting criterion A class label A sub decision A test condition
Added by Alex B.
Step 1
** Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 99 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Decision tree classification: Consider the following instances. Consider the case of no branching. Which class will you predict? What are the misclassification error and the Gini index? Consider the cases of branching using attributes a1, a2, and a3. For each of the three cases, show the contingency table, the gains in misclassification error rate, and the gains in Gini index. (Hint: for a3, use the split of a3 < 5 and a3 ≥ 5.) According to the misclassification error rate, which attribute would be chosen as the first splitting attribute? According to the Gini index, which attribute would be chosen as the first splitting attribute? What are the precision and recall when splitting using attribute a3 with a3 < 5 and a3 ≥ 5.
Sri K.
Which of the following is true for a decision tree? A) Decision tree is an example of linear classifier. B) The entropy of a node typically decreases as we go down a decision tree. C) Entropy is a measure of purity. D) An attribute with lower mutual information should be preferred to other attributes.
Madhur L.
Mauya M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD