手法を比較

	ブースティングアンサンブル	勾配ブースティング	多数決 (Majority Voting)
分野	アンサンブル学習	機械学習	アンサンブル学習
系統	Machine learning	Machine learning	Machine learning
提唱年	1990	2001	1996
提唱者	Robert Schapire	Friedman, J. H.	Leo Breiman
種類	sequential ensemble	Ensemble (sequential boosting of decision trees)	voting aggregation
原典	Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227.	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.
別名	adaptive boosting, sequential ensemble	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	hard voting
関連	4	5	5
概要	Boosting is an ensemble method that sequentially trains weak learners and combines them into a strong predictor by focusing on samples that previous models misclassified. Each new weak learner is weighted according to the difficulty of its training task, and final predictions are made via weighted voting. Pioneered by Schapire (1990) and refined in AdaBoost (Freund & Schapire, 1997), boosting converts weak learners (barely better than random) into strong learners through sequential reweighting.	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.