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

	ব্যাচিং এনসেম্বল	গ্রেডিয়েন্ট বুস্টিং	সংখ্যাগরিষ্ঠের ভোটদান
ক্ষেত্র	এনসেম্বল শিখন	যন্ত্র শিখন	এনসেম্বল শিখন
পরিবার	Machine learning	Machine learning	Machine learning
উদ্ভবের বছর	1996	2001	1996
প্রবর্তক	Leo Breiman	Friedman, J. H.	Leo Breiman
ধরন	parallel ensemble	Ensemble (sequential boosting of decision trees)	voting aggregation
মৌলিক উৎস	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.	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140.
অপর নাম	bootstrap aggregating	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	hard voting
সম্পর্কিত	4	5	5
সারসংক্ষেপ	Bagging, short for bootstrap aggregating, is an ensemble method that reduces variance by training multiple copies of a single learning algorithm on different random subsets of the training data. Each subset is created via bootstrap sampling—randomly drawing samples with replacement. Predictions are combined through majority voting (classification) or averaging (regression). Introduced by Leo Breiman in 1996, bagging forms the foundation for random forests and is particularly effective for reducing overfitting in high-variance models.	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.	Majority voting is an ensemble method that combines predictions from multiple base classifiers by selecting the class that receives the most votes. Each base classifier casts one vote for a predicted class, and the final prediction is the class with the majority (plurality). This approach was formalized by Leo Breiman and colleagues in the 1990s as a simple yet effective way to improve classification accuracy.