ScholarGate
助手

方法对比

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

Boosting×决策树×极端随机树 (Extra Trees)×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份1990–199719842006
提出者Schapire, R. E.; Freund, Y.Breiman, Friedman, Olshen & StoneGeurts, P.; Ernst, D.; Wehenkel, L.
类型Sequential ensemble (iterative reweighting)Recursive partitioning (if-then rules)Ensemble (extremely randomized decision trees)
开创性文献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. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗
别名AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeExtremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET
相关655
摘要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.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.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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