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/ko/compare