ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

Active Learning Voting Ensemble×Boosting×
TudományterületGépi tanulásGépi tanulás
MódszercsaládMachine learningMachine learning
Keletkezés éve19921990–1997
MegalkotóSeung, H. S., Opper, M., & Sompolinsky, H.Schapire, R. E.; Freund, Y.
TípusActive learning with ensemble votingSequential ensemble (iterative reweighting)
Alapmű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 ↗
Alternatív nevekQuery by Committee, QBC, active ensemble learning, committee-based active learningAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Kapcsolódó56
Összefoglaló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.
ScholarGateAdatkészlet
  1. v1
  2. 2 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: Active Learning Voting Ensemble · Boosting. Letöltve 2026-06-15, forrás: https://scholargate.app/hu/compare