Machine learningMachine learning
Boosting
Boosting是一种顺序集成技术，它通过反复关注先前学习器出错的样本来将许多仅略优于随机猜测的学习器转换为一个高精度的模型，然后以与各个学习器准确度成比例的权重组合所有学习器。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
+29 more
来源
- 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: 10.1006/jcss.1997.1504 ↗
- Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197–227. DOI: 10.1007/BF00116037 ↗
如何引用本页
ScholarGate. (2026, June 3). Boosting (Ensemble of Sequentially Weighted Weak Learners). ScholarGate. https://scholargate.app/zh/machine-learning/boosting
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bagging（Bootstrap Aggregating）机器学习↔ compare
- 决策树机器学习↔ compare
- 梯度提升（Gradient Boosting）机器学习↔ compare
- 随机森林机器学习↔ compare
- 投票集成 (Voting Ensemble)机器学习↔ compare
- XGBoost机器学习↔ compare
被引用于
主动学习提升（Active Learning Boosting）主动学习堆叠集成主动学习投票集成贝叶斯装袋法贝叶斯提升 (Bayesian Boosting)贝叶斯堆叠集成集成主动学习集成先验算法 (Ensemble Apriori Algorithm)集成关联规则集成决策树集成联邦学习集成少样本学习集成高斯混合模型集成逻辑回归集成朴素贝叶斯Ensemble Online Learning集成半监督学习集成支持向量机集成迁移学习在线提升 (Online Boosting)在线梯度提升正则化提升正则化决策树正则化梯度提升正则化堆叠集成稳健自举聚合鲁棒提升鲁棒梯度提升鲁棒堆叠集成鲁棒投票集成自监督增强学习半监督梯度提升半监督投票集成投票集成 (Voting Ensemble)