Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| XGBoost bayésien× | Forêt Aléatoire× | |
|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 2012–2016 | 2001 |
| Auteur d'origine≠ | Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization) | Breiman, L. |
| Type≠ | Ensemble (gradient boosted trees with Bayesian hyperparameter search) | Ensemble (bagging of decision trees) |
| Source fondatrice≠ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Alias | Bayesian XGBoost, XGBoost with Bayesian Optimization, BayesOpt-XGBoost, Bayes-tuned XGBoost | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Apparentées | 4 | 4 |
| Résumé≠ | Bayesian XGBoost combines the predictive power of Extreme Gradient Boosting with Bayesian optimization for hyperparameter tuning. Instead of grid or random search, a probabilistic surrogate model guides the search for optimal learning rate, tree depth, and regularization parameters, achieving near-peak performance with far fewer evaluations than exhaustive search approaches. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateJeu de données ↗ |
|
|