ScholarGate
助手

方法对比

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

集成决策树×Bagging(Bootstrap Aggregating)×决策树×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份1996–200019961984
提出者Breiman, L.; Dietterich, T. G.Breiman, L.Breiman, Friedman, Olshen & Stone
类型Ensemble (multiple decision trees combined)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Recursive partitioning (if-then rules)
开创性文献Dietterich, T. G. (2000). Ensemble methods in machine learning. In Multiple Classifier Systems, Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer, Berlin, Heidelberg. DOI ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗
别名decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees)Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
相关655
摘要Ensemble Decision Tree methods train multiple decision trees and combine their outputs to produce predictions that are more accurate and stable than any single tree. Covering strategies such as bagging, random subspacing, and voting, they are among the most effective off-the-shelf techniques for tabular classification and regression tasks.Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 3 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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