ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

یادگیری فعال×بگینگ (تجمیع بوت‌استرپ)×
حوزهیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learning
سال پیدایش20091996
پدیدآورBurr SettlesBreiman, L.
نوعInteractive supervised learning frameworkEnsemble meta-algorithm (variance reduction via bootstrap aggregation)
منبع بنیادینSettles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗
نام‌های دیگرQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
مرتبط25
خلاصه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.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. 1 منابع
  3. PUBLISHED
  1. v1
  2. 3 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Active Learning · Bagging. بازیابی‌شده در 2026-06-17 از https://scholargate.app/fa/compare