ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Bagging (Agregare Bootstrap)×Stacking×
DomeniuÎnvățare automatăÎnvățare automată
FamilieMachine learningMachine learning
Anul apariției19961992
Autorul originalBreiman, L.Wolpert, D.H.
TipEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Ensemble (heterogeneous meta-learning)
Sursa seminalăBreiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗
Denumiri alternativeBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorStacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner
Înrudite55
RezumatBagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.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.
ScholarGateSet de date
  1. v1
  2. 3 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Bagging · Stacking. Preluat la 2026-06-17 de pe https://scholargate.app/ro/compare