השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| למידה פעילה של K-שכנים קרובים ביותר× | עץ החלטה ללמידה אקטיבית× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 1951–2010 | 1984–2010 |
| הוגה השיטה≠ | Settles, B. (active learning framework); Fix & Hodges (KNN base) | Settles, B. (active learning framework); Breiman et al. (decision tree base) |
| סוג≠ | Active learning with KNN base learner | Active learning with decision tree base learner |
| מקור מכונן | 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 ↗ |
| כינויים | 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 |
| קשורות≠ | 4 | 5 |
| תקציר≠ | 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. |
| ScholarGateמערך נתונים ↗ |
|
|