ScholarGate
助手

方法对比

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

集成主动学习×主动学习×Boosting×半监督学习×
领域机器学习机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learningMachine learning
起源年份199220091990–19971970s–2006 (formalized)
提出者Seung, H. S., Opper, M., & Sompolinsky, H.Burr SettlesSchapire, R. E.; Freund, Y.Vapnik, V. N. and others (community of researchers, 1970s–2000s)
类型Ensemble-based active learning strategyInteractive supervised learning frameworkSequential ensemble (iterative reweighting)Learning paradigm
开创性文献Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT 1992), pp. 287–294. ACM. link ↗Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗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 ↗Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
别名Query by Committee, QBC active learning, committee-based active learning, ensemble query strategyQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleSSL, semi-supervised machine learning, transductive learning, label-efficient learning
相关5265
摘要Ensemble Active Learning combines a committee of diverse models with an active learning loop to select the most informative unlabeled examples for labeling. Rooted in the Query by Committee framework introduced by Seung et al. (1992), it uses disagreement among committee members as a signal for uncertainty, reducing the number of labeled examples needed to achieve strong predictive performance.Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised 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.Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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