ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

למידה פעילה של K-שכנים קרובים ביותר×עץ החלטה ללמידה אקטיבית×
תחוםלמידת מכונהלמידת מכונה
משפחהMachine learningMachine learning
שנת המקור1951–20101984–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 learnerActive 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 KNNAL-DT, active decision tree, query-based decision tree learning, uncertainty-sampling decision tree
קשורות45
תקציר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מערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Active learning K-nearest neighbors · Active learning Decision tree. אוחזר בתאריך 2026-06-18 מתוך https://scholargate.app/he/compare