ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

アクティブラーニングK近傍法 (Active Learning K-Nearest Neighbors)×アクティブラーニング×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年1951–20102009
提唱者Settles, B. (active learning framework); Fix & Hodges (KNN base)Burr Settles
種類Active learning with KNN base learnerInteractive supervised learning framework
原典Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison. link ↗Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗
別名AL-KNN, active KNN, query-based nearest neighbor learning, uncertainty-sampling KNNQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme
関連42
概要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 is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Active learning K-nearest neighbors · Active Learning. 2026-06-17に以下より取得 https://scholargate.app/ja/compare