手法を比較

	ブースティングアンサンブル	多数決 (Majority Voting)	ランダムフォレスト
分野	アンサンブル学習	アンサンブル学習	機械学習
系統	Machine learning	Machine learning	Machine learning
提唱年	1990	1996	2001
提唱者	Robert Schapire	Leo Breiman	Breiman, L.
種類	sequential ensemble	voting aggregation	Ensemble (bagging of decision trees)
原典	Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227.	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
別名	adaptive boosting, sequential ensemble	hard voting	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連	4	5	4
概要	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.	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.