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/fa/compare