ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

正则化决策树×极端随机树 (Extra Trees)×随机森林×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份198420062001
提出者Breiman, L., Friedman, J., Olshen, R., & Stone, C.Geurts, P.; Ernst, D.; Wehenkel, L.Breiman, L.
类型Supervised learning (regularized tree)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-8Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
别名pruned decision tree, cost-complexity pruned tree, penalized decision tree, constrained CARTExtremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ETRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关654
摘要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.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Regularized Decision Tree · Extra Trees · Random Forest. 于 2026-06-18 检索自 https://scholargate.app/zh/compare