Catatan bukti metode

Active learning Decision tree

Active learning with a decision tree combines the interpretable structure of a CART-style tree with a query strategy that selects the most informative unlabeled instances for human annotation. The model iteratively requests labels only for examples it is most uncertain about, minimising labeling cost while maximising classification accuracy on tabular data.

Sources recorded, not reviewed

Catatan sumber

Kutipan disalin apa adanya dari catatan sumber metode. Tidak ada verifikasi tingkat klaim yang disimpulkan darinya.

Active Learning with Decision Tree Classifier

Catatan metode taksonomi · ml-model / machine-learning

Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison. · URL
Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and Regression Trees. Wadsworth & Brooks. · ISBN 978-0-412-04841-8

Buka metode lengkap

Klaim yang dikurasi

Klaim tersimpan dalam buku besar bukti, masing-masing dengan penilaiannya sendiri.

Belum ada klaim yang dikurasi

Tampilan ini tidak menciptakan penilaian klaim ketika buku besar tidak memilikinya.

Metode terkait

Dihasilkan dari grafik metode dan ditampilkan sebagai relasi yang disarankan mesin — tidak ada klaim bukti yang disimpulkan.

Same method familyActive Learningmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketActive Learning Logistic Regressionmachine-suggested · Relational suggestion, not evidence.Same method familyDecision Treemachine-suggested · Relational suggestion, not evidence.Same method familyRandom Forestmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketSemi-supervised Decision Treemachine-suggested · Relational suggestion, not evidence.