ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

تجميع التصويت للتعلم النشط×التعزيز×
المجالتعلم الآلةتعلم الآلة
العائلة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/ar/compare