ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Învățare activă cu ansambluri stratificate×Boosting×
DomeniuÎnvățare automatăÎnvățare automată
FamilieMachine learningMachine learning
Anul apariției1992–20121990–1997
Autorul originalWolpert, D. H. (stacking); Settles, B. (active learning survey)Schapire, R. E.; Freund, Y.
TipHybrid (active learning + stacked ensemble)Sequential ensemble (iterative reweighting)
Sursa seminalăWolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241–259. 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 ↗
Denumiri alternativeAL-stacking, query-by-committee stacking, active stacked generalization, stacking with active queryAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Înrudite56
RezumatActive Learning Stacking Ensemble combines an active learning query loop with stacked generalization: a pool of unlabeled data is available, and the model iteratively selects the most informative instances for human labeling, using those labels to train and refine a stacking ensemble of multiple base learners topped by a meta-learner. This approach reduces annotation cost while maximizing the predictive power of the ensemble.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.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Active learning Stacking ensemble · Boosting. Preluat la 2026-06-15 de pe https://scholargate.app/ro/compare