ScholarGate
助手

方法对比

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

极端随机树 (Extra Trees)×梯度提升(Gradient Boosting)×随机森林×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份200620012001
提出者Geurts, P.; Ernst, D.; Wehenkel, L.Friedman, J. H.Breiman, L.
类型Ensemble (extremely randomized decision trees)Ensemble (sequential boosting of decision trees)Ensemble (bagging of decision trees)
开创性文献Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
别名Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ETGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关554
摘要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.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.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. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Extra Trees · Gradient Boosting · Random Forest. 于 2026-06-17 检索自 https://scholargate.app/zh/compare