Robust Bagging
Robust Bagging udvider det klassiske Bootstrap Aggregating (Bagging) framework ved at erstatte eller supplere standard basis-læringsmodeller med robuste estimatorer – eller ved at anvende robuste aggregeringsregler – således at ensemblet forbliver præcist, selv når træningsdata indeholder outliers, fejlklassificerede instanser eller støjfordelinger med tunge haler.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI: 10.1007/BF00058655 ↗
- Chen, C., Liaw, A., & Breiman, L. (2004). Using Random Forest to Learn Imbalanced Data. University of California, Berkeley, Technical Report 666. link ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Robust Bagging (Bootstrap Aggregating with Robust Base Learners). ScholarGate. https://scholargate.app/da/machine-learning/robust-bagging
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bagging (Bootstrap Aggregating)Maskinlæring↔ compare
- BoostingMaskinlæring↔ compare
- Random ForestMaskinlæring↔ compare
- Robust BoostingMaskinlæring↔ compare
- Robust Random ForestMaskinlæring↔ compare
- StemmeensembleMaskinlæring↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →