Question: When a target variable is categorical, the CART algorithm produces a __________ tree to predict the class memberships of new cases. classification pruned minimum regression
When a target variable is categorical, the CART algorithm produces a __________ tree to predict the class memberships of new cases.
|
| classification |
|
| pruned |
|
| minimum |
|
| regression |
Which tree is the least complex and contains the smallest validation error?
|
| categorical tree |
|
| full-grown tree |
|
| minimum error tree |
|
| best-pruned tree |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
