ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

Robustno slaganje×Boosting×
OblastMašinsko učenjeMašinsko učenje
PorodicaMachine learningMachine learning
Godina nastanka1992 (stacking); robust variants 2000s–present1990–1997
TvoracWolpert, D. H. (stacking); robust extensions by multiple authorsSchapire, R. E.; Freund, Y.
TipEnsemble (stacking with robust meta-learner)Sequential ensemble (iterative reweighting)
Temeljni izvorWolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗
Drugi nazivirobust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learnerAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Srodne56
SažetakRobust Stacking Ensemble extends classical stacked generalization by replacing the ordinary meta-learner with a robust estimator — such as a Huber-loss regressor, quantile regression, or a model trained on trimmed residuals — so that the ensemble's combination layer is resistant to outliers and noisy base-learner predictions. It improves predictive accuracy and reliability on real-world datasets with contaminated labels or heavy-tailed error distributions.Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Robust Stacking Ensemble · Boosting. Preuzeto 2026-06-15 sa https://scholargate.app/sr/compare