ScholarGate
المساعد

قارن الطرق

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

تجميع التصويت للتعلم النشط×التعبئة (تجميع العينات العشوائية)×
المجالتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learning
سنة النشأة19921996
صاحب الطريقةSeung, H. S., Opper, M., & Sompolinsky, H.Breiman, L.
النوعActive learning with ensemble votingEnsemble meta-algorithm (variance reduction via bootstrap aggregation)
المصدر التأسيسي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 ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗
الأسماء البديلةQuery by Committee, QBC, active ensemble learning, committee-based active learningBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
ذات صلة55
الملخص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.Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 3 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Active Learning Voting Ensemble · Bagging. استُرجع بتاريخ 2026-06-15 من https://scholargate.app/ar/compare