পদ্ধতির তুলনা করুন

	বুস্টিং	Robust Boosting
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1990–1997	1999–2001
প্রবর্তক	Schapire, R. E.; Freund, Y.	Freund, Y.; Mason, L. et al.
ধরন	Sequential ensemble (iterative reweighting)	Ensemble (robust sequential boosting)
মৌলিক উৎস	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.	Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318.
অপর নাম	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
সম্পর্কিত	6	6
সারসংক্ষেপ	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.	Robust Boosting modifies standard boosting algorithms — such as AdaBoost or gradient boosting — by replacing the default exponential or squared loss with robust loss functions (e.g., Huber, logistic, or truncated losses) or by incorporating noise-tolerance mechanisms, so that the ensemble remains accurate even when training data contain outliers, label noise, or heavy-tailed errors.