Metodbevispost

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

Källpost

Citat kopierade ordagrant från metodens källpost. Ingen verifiering på källnivå härleds från dem.

Active Learning with Decision Tree Classifier

Taxonomisk metodpost · 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

Öppna fullständig metod

Kuraterade påståenden

Påståenden lagrade i bevisloggen, var och en med sin egen bedömning.

Inga kuraterade påståenden ännu

Denna vy hittar inte på en påståendebedömning när loggen saknar en.

Relaterade metoder

Genererade från metodgrafen och visade som maskinföreslagna relationer – inga bevispåståenden härleds.

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.