Home > Machine Learning 101 > Quizzes > Machine Learning 101 Practice Test: Ensemble Learning
Machine Learning 101 Practice Test: Ensemble Learning
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 0% Most missed: “Which of the following is not a problem dependent ECOC design?”
Quiz questions on ensemble learning, covering error-correcting output codes, model combination schemes, boosting weak learnability, the AdaBoost algorithm, and stacking. Ensemble learning is a machine learning technique that combines the predictions of multiple models to improve performance and reduce the risk of choosing a poor model. The goal is to achieve better performance with the ensemble of models than with any individual model. Ensemble learning works best when the base models are not correlated. For example, you can train different models such as linear models, decision trees, and... Show more
Machine Learning 101 Practice Test: Ensemble Learning
Time left 00:00
25 Questions

1. In the simplest case of voting, all the learners are given equal weight.
2. AdaBoost runs in polynomial time.
3. Which of the following is not a multi – expert model combination scheme to generate the final output?
4. Which of the following is not a problem independent ECOC design?
5. Which of the following statements is false about stacking?
6. Forest-ECOC design which uses n = (Nc−1).T dichotomizers, extends the variability of the classifiers of the DECOC design.
7. Which of the following statements is false about error-correcting output codes (ECOC)?
8. The issues that boosting addresses are the bias-complexity tradeoff and computational complexity of learning.
9. The original boosting method requires a very large training sample.
10. Assume we are combining three classifiers that classify a training sample as given in the table. Then what is the class of the samples using majority voting?
11. Problem independent approaches take into account the distribution of the data to define the coding matrix.
12. Different algorithms make different assumptions about the data and lead to different classifiers in generating diverse learners.
13. Hard voting is where the model is selected from an ensemble to make the final prediction using simple majority vote.
14. Which of the following is not a problem dependent ECOC design?
15. Consider there are 5 employees A, B, C, D, and E of ABC company. Where people A, B and C are experienced, D and E are fresher. They have rated the company app as given in the table. What will be the final prediction if we are taking the weighted average?
16. Stacking trains a meta-learner to combine the individual learners.
17. AdaBoost is an algorithm that has access to a weak learner and finds a hypothesis with a low empirical risk.
18. Stacked generalization extends voting.
19. With the product rule, if one learner has an output of 0, the overall output goes to zero.
20. How many single bit errors take to turn “cow” to “fox”?
21. Which of the following statements is not true about multi-class classification?
22. Which of the following statements is true about the combination rules?
23. The ABC company has released their Android app. And 80 people have rated the app on a scale of 5 stars. Out of the total people 15 people rated it with 1 star, 20 people rated it with 2 stars, 30 people rated it with 3 stars, 10 people rated it with 4 stars and 5 people rated it with 5 stars. What will be the final prediction if we take the average of individual predictions?
24. Which of the following statements is false about Ensemble voting?
25. Consider there are 7 weak learners, out of which 4 learners are voted as FAKE for a social media account and 3 learners are voted as REAL. What will be the final prediction for the account if we are using a majority voting method?