Machine learningMachine learning
Active Learning K-Nearest Neighbors
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.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison. link ↗
- Zhu, X., Lafferty, J., & Ghahramani, Z. (2003). Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions. Proceedings of the ICML 2003 Workshop on the Continuum from Labeled to Unlabeled Data, 58–65. link ↗