ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Κανονικοποιημένο Στοίβαγμα Συνόλων (Regularized Stacking Ensemble)×Stacking×
ΠεδίοΜηχανική ΜάθησηΜηχανική Μάθηση
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης1992–19961992
ΔημιουργόςWolpert, D. H. (stacking); Breiman, L. (regularized meta-learner formulation)Wolpert, D.H.
ΤύποςEnsemble (stacked generalization with regularized meta-learner)Ensemble (heterogeneous meta-learning)
Θεμελιώδης πηγήWolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241–259. DOI ↗Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗
Εναλλακτικές ονομασίεςregularized stacked generalization, ridge stacking, lasso meta-learner ensemble, penalized stackingStacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner
Συναφείς65
ΣύνοψηRegularized Stacking Ensemble is a two-level ensemble method in which predictions from multiple diverse base learners are combined by a regularized meta-learner — typically ridge regression, lasso, or elastic net — to suppress overfitting in the combination layer. Regularization ensures that the meta-learner assigns stable, well-calibrated weights to base model outputs rather than memorizing noise in the training fold predictions.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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Regularized Stacking Ensemble · Stacking. Ανακτήθηκε στις 2026-06-15 από https://scholargate.app/el/compare