ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Regresi Logistik Pembelajaran Aktif×Random Forest×
BidangPembelajaran MesinPembelajaran Mesin
KeluargaMachine learningMachine learning
Tahun asal1994–20102001
PengasasLewis, D. D. & Gale, W. A.; Settles, B. (survey)Breiman, L.
JenisActive learning framework with logistic regression base learnerEnsemble (bagging of decision trees)
Sumber perintisSettles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
AliasAL-LR, logistic regression active learner, uncertainty sampling logistic regression, pool-based active logistic classifierRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Berkaitan44
RingkasanActive Learning with Logistic Regression is an iterative label-efficient framework in which a logistic regression model selects the unlabeled examples it is most uncertain about, an oracle (human annotator) labels them, and the model is retrained — repeating until a labeling budget or accuracy target is met. It dramatically reduces annotation cost compared to random labeling.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Active Learning Logistic Regression · Random Forest. Dicapai 2026-06-17 daripada https://scholargate.app/ms/compare