ScholarGate
助手

方法对比

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

极端随机树 (Extra Trees)×决策树×梯度提升(Gradient Boosting)×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份200619842001
提出者Geurts, P.; Ernst, D.; Wehenkel, L.Breiman, Friedman, Olshen & StoneFriedman, J. H.
类型Ensemble (extremely randomized decision trees)Recursive partitioning (if-then rules)Ensemble (sequential boosting of decision trees)
开创性文献Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
别名Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ETKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
相关555
摘要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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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