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

	Bagging (Bootstrap Aggregating)	Διαδικασία Γκάους
Πεδίο	Μηχανική Μάθηση	Μηχανική Μάθηση
Οικογένεια	Machine learning	Machine learning
Έτος προέλευσης	1996	2006 (book); roots in Kriging, 1951)
Δημιουργός	Breiman, L.	Rasmussen, C. E. & Williams, C. K. I.
Τύπος	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Probabilistic non-parametric model
Θεμελιώδης πηγή	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9
Εναλλακτικές ονομασίες	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	GP, Gaussian Process Regression, GPR, Kriging
Συναφείς	5	3
Σύνοψη	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.	A Gaussian Process (GP) is a non-parametric, fully probabilistic machine learning model that places a prior distribution directly over functions. Rather than predicting a single value, it returns a predictive mean and a calibrated uncertainty estimate at every test point, making it especially valuable for regression on small to medium datasets and for Bayesian optimization tasks.