ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Empilement×XGBoost×
DomaineApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learning
Année d'origine19922016
Auteur d'origineWolpert, D.H.Chen, T. & Guestrin, C.
TypeEnsemble (heterogeneous meta-learning)Ensemble (gradient-boosted decision trees)
Source fondatriceWolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
AliasStacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learnerXGBoost, extreme gradient boosting, scalable tree boosting
Apparentées55
RésuméStacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions.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
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Stacking · XGBoost. Consulté le 2026-06-17 sur https://scholargate.app/fr/compare