Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Aktivní učení K-nejbližších sousedů× | Rozhodovací strom pro aktivní učení× | |
|---|---|---|
| Obor | Strojové učení | Strojové učení |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 1951–2010 | 1984–2010 |
| Tvůrce≠ | Settles, B. (active learning framework); Fix & Hodges (KNN base) | Settles, B. (active learning framework); Breiman et al. (decision tree base) |
| Typ≠ | Active learning with KNN base learner | Active learning with decision tree base learner |
| Původní zdroj | Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison. link ↗ | Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison. link ↗ |
| Další názvy | AL-KNN, active KNN, query-based nearest neighbor learning, uncertainty-sampling KNN | AL-DT, active decision tree, query-based decision tree learning, uncertainty-sampling decision tree |
| Příbuzné≠ | 4 | 5 |
| Shrnutí≠ | Active learning with K-nearest neighbors combines the instance-based prediction of KNN with an iterative query strategy that selects the most informative unlabeled examples for annotation. The model requests labels only for instances where neighborhood vote margins are narrowest, achieving competitive accuracy with far fewer labeled examples than fully supervised KNN on tabular data. | 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. |
| ScholarGateDatová sada ↗ |
|
|