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