__________ is a boosting algorithm that builds trees one at a time, where each tree corrects the errors of the previous one.
- AdaBoost
- Bagging
- Gradient Boosting
- Random Forest
AdaBoost is a boosting algorithm that builds trees sequentially, with each tree correcting the errors of the previous one by giving more weight to the misclassified instances.
Loading...
Related Quiz
- What are some common applications for each of the four types of Machine Learning: Supervised, Unsupervised, Semi-Supervised, and Reinforcement?
- In what scenarios would you use PCA, and when would you opt for other methods like LDA or t-SNE?
- How does Random Forest handle missing values during the training process?
- How does Polynomial Regression differ from Simple Linear Regression?
- What does the Mean Absolute Error (MAE) metric represent in regression analysis?