ScholarGate
助手

方法对比

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

主动学习投票集成×Boosting×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份19921990–1997
提出者Seung, H. S., Opper, M., & Sompolinsky, H.Schapire, R. E.; Freund, Y.
类型Active learning with ensemble votingSequential ensemble (iterative reweighting)
开创性文献Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT '92), pp. 287–294. ACM. DOI ↗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 ↗
别名Query by Committee, QBC, active ensemble learning, committee-based active learningAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
相关56
摘要Active Learning Voting Ensemble — formally known as Query by Committee — is an active learning strategy that trains a committee of diverse models and selects the unlabeled examples where the committee members disagree most for human annotation. By focusing labeling effort on the most informative points, it achieves high accuracy with far fewer labeled examples than passive learning requires.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Active Learning Voting Ensemble · Boosting. 于 2026-06-15 检索自 https://scholargate.app/zh/compare