跳到内容ScholarGate
文库我的文库桌面Review Studio助手
登录
Boosting Ensemble/证据
方法证据记录

Boosting Ensemble

Boosting is an ensemble method that sequentially trains weak learners and combines them into a strong predictor by focusing on samples that previous models misclassified. Each new weak learner is weighted according to the difficulty of its training task, and final predictions are made via weighted voting. Pioneered by Schapire (1990) and refined in AdaBoost (Freund & Schapire, 1997), boosting converts weak learners (barely better than random) into strong learners through sequential reweighting.

Sources recorded, not reviewed

源记录

引文逐字复制自方法源记录。这些引文不代表任何层级的验证。

Boosting Ensemble Method
分类方法记录 · ml-model / ensemble-learning
  • Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227. · DOI 10.1023/A:1022648800760
  • 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
打开完整方法

精选声明

声明已持久化到证据分类账中,每个声明都有自己的评估。

尚无精选声明

当分类账中没有声明时,此视图不会自行创建声明评估。

相关方法

从方法图中生成,显示为机器建议的关系 — 不推断任何证据声明。

Same method familyAdaBoostmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketBagging Ensemblemachine-suggested · Relational suggestion, not evidence.Same method familyGradient Boostingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketMajority Votingmachine-suggested · Relational suggestion, not evidence.

证据状态

Sources recorded, not reviewed

Bibliographic sources are present. Claim-level evidence review has not been performed.

来源

从方法源记录复制的 2 条记录的引文。

操作

打开方法页面
ScholarGate

以内容为本的研究方法参考文库——每种方法是什么、如何运作、源自何处。

开放数据(CC-BY)

探索

  • 文库
  • 搜索方法…
  • 按领域浏览
  • 学科领域
  • 历程
  • 对比
  • 该用哪种方法?

参考

  • 学科
  • 图集
  • 术语表
  • 方法论
  • 哲学

工作区

  • 我的文库
  • 桌面
  • 聊天

公司

  • 关于
  • 价格
  • 联系我们
  • 建议新方法

本词条系根据已发表文献整理,仅供参考。核实任何信息的准确性及其是否适用于您的具体用途,仍由您自行负责。

© 2026 ScholarGate · 研究方法参考文库
  • 隐私
  • Cookie
  • 条款
  • 删除账户