ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Glasački ansambl aktivnog učenja×Boosting×
PodručjeStrojno učenjeStrojno učenje
ObiteljMachine learningMachine learning
Godina nastanka19921990–1997
TvoracSeung, H. S., Opper, M., & Sompolinsky, H.Schapire, R. E.; Freund, Y.
VrstaActive learning with ensemble votingSequential ensemble (iterative reweighting)
Temeljni izvorSeung, 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 ↗
Drugi naziviQuery by Committee, QBC, active ensemble learning, committee-based active learningAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Srodne56
SažetakActive 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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Active Learning Voting Ensemble · Boosting. Preuzeto 2026-06-15 s https://scholargate.app/hr/compare