Active learning Boosting
Active Learning Boosting combines the query-driven label acquisition of active learning with the weighted-ensemble logic of boosting algorithms such as AdaBoost. The model iteratively selects the most informative unlabeled examples to annotate — guided by the disagreement or uncertainty within the boosting ensemble — and retrains after each new label, achieving high accuracy with far fewer labeled examples than passive learning.
Izvorni zapis
Citati kopirani doslovno iz izvornog zapisa metode. Ne impliciraju nikakvu provjeru na razini tvrdnje.
- Abe, N. & Mamitsuka, H. (1998). Query Learning Strategies Using Boosting and Bagging. Proceedings of the 15th International Conference on Machine Learning (ICML 1998), pp. 1–9. Morgan Kaufmann. · URL
- Settles, B. (2009). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison. · URL
Uređene tvrdnje
Tvrdnje pohranjene u knjigu dokaza, svaka s vlastitom procjenom.
Ovaj prikaz ne izmišlja procjenu tvrdnje kada knjiga dokaza nema nijednu.
Povezane metode
Generirano iz grafa metode i prikazano kao strojno predložene relacije — ne implicira se nikakva tvrdnja dokaza.