手法を比較

	正則化決定木	ブースティング	ランダムフォレスト
分野	機械学習	機械学習	機械学習
系統	Machine learning	Machine learning	Machine learning
提唱年	1984	1990–1997	2001
提唱者	Breiman, L., Friedman, J., Olshen, R., & Stone, C.	Schapire, R. E.; Freund, Y.	Breiman, L.
種類	Supervised learning (regularized tree)	Sequential ensemble (iterative reweighting)	Ensemble (bagging of decision trees)
原典	Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and Regression Trees. Wadsworth. ISBN: 978-0-412-04841-8	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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
別名	pruned decision tree, cost-complexity pruned tree, penalized decision tree, constrained CART	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連	6	6	4
概要	A regularized decision tree is a decision tree model whose complexity is intentionally limited through pruning, depth constraints, or penalty terms to prevent overfitting. Rooted in Breiman et al.'s CART framework (1984), regularization converts the greedy tree-growing procedure into a bias-variance tradeoff, yielding models that generalize better to unseen data than fully-grown trees.	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.	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.