Bandingkan metode

	Robust Stacking Ensemble	Bagging (Bootstrap Aggregating)	Peningkatan Gradien
Bidang	Pembelajaran Mesin	Pembelajaran Mesin	Pembelajaran Mesin
Keluarga	Machine learning	Machine learning	Machine learning
Tahun asal	1992 (stacking); robust variants 2000s–present	1996	2001
Pencetus	Wolpert, D. H. (stacking); robust extensions by multiple authors	Breiman, L.	Friedman, J. H.
Tipe	Ensemble (stacking with robust meta-learner)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (sequential boosting of decision trees)
Sumber perintis	Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
Alias	robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learner	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Terkait	5	5	5
Ringkasan	Robust 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.	Bagging, 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.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.