Question
Give an example of deriving a random forest posterior from posteriors of at least 3 individual trees:(a) Using average-based ensemble model.(b) Using multiplication-based ensemble model.
Step 1
Let's assume we have three decision trees, T1, T2, and T3. Each tree provides a posterior probability for a given class label, say class A, based on the input features. Show more…
Show all steps
Your feedback will help us improve your experience
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
QUESTION 2 Suppose we produce ten bootstrapped samples from a data set containing red and green classes. We then apply a classification tree to each bootstrapped sample and, for a specific value of X, produce 10 estimates of the probability of the class is red: 0.1, 0.15, 0.2, 0.2, 0.55, 0.6, 0.6, 0.65, 0.7, and 0.75. There are two common ways to combine these results together into a single class prediction. One is the majority vote approach discussed in this chapter. The second approach is to classify based on the average probability. In this example, what is the final classification under each of these two approaches?
Suppose we produce ten bootstrapped samples from a data set containing red and green classes. We apply a classification tree to each bootstrapped sample and, for a specific value of X, produce 10 estimates of P(Class is Red|X): 0.1, 0.15, 0.2, 0.2, 0.55, 0.6, 0.6, 0.65, 0.7, and 0.75. There are two common ways to combine these results together into a single class prediction. One is the majority vote approach. If P(Class is Red|X)> 0.5, the predicted class is red. Otherwise, it is green. The second approach is to classify based on the average probability. If the average probability is above 0.5, it is red; otherwise, green. In this example, what is the final classification under each of these two approaches?
Watch the video solution with this free unlock.
EMAIL
PASSWORD