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× | XGBoost× | |
|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 2012–2016 | 2016 |
| Auteur d'origine≠ | Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization) | Chen, T. & Guestrin, C. |
| Type≠ | Ensemble (gradient boosted trees with Bayesian hyperparameter search) | Ensemble (gradient-boosted 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 ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Alias≠ | Bayesian XGBoost, XGBoost with Bayesian Optimization, BayesOpt-XGBoost, Bayes-tuned XGBoost | XGBoost, extreme gradient boosting, scalable tree boosting |
| Apparentées≠ | 4 | 5 |
| 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. | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. |
| ScholarGateJeu de données ↗ |
|
|