方法对比

	正则化决策树	Boosting	极端随机树 (Extra Trees)	随机森林
领域	机器学习	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning	Machine learning
起源年份	1984	1990–1997	2006	2001
提出者	Breiman, L., Friedman, J., Olshen, R., & Stone, C.	Schapire, R. E.; Freund, Y.	Geurts, P.; Ernst, D.; Wehenkel, L.	Breiman, L.
类型	Supervised learning (regularized tree)	Sequential ensemble (iterative reweighting)	Ensemble (extremely randomized decision trees)	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.	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.	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	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关	6	6	5	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.	Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.	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.