k-nearest neighbors algorithm - Wikipedia
- https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm
- Not to be confused with k-means clustering.
- In pattern recognition, the k-nearest neighbors algorithm (k-NN) is a non-parametric method used for classification and regression.[1] In both cases, the input consists of the k closest training examples in the feature space. The output depends on whether k-NN is used for classification or regression.
- k-NN is a type of instance-based learning, or lazy learning, where the function is only approximated locally and all computation is deferred until classification. The k-NN algorithm is among the simplest of all machine learning algorithms.
学习笔记之scikit-learn - 浩然119 - 博客园
- https://www.cnblogs.com/pegasus923/p/9997485.html
Machine Learning with Python: k-Nearest Neighbor Classifier in Python
- https://www.python-course.eu/k_nearest_neighbor_classifier.php
Refining a k-Nearest-Neighbor classification
- https://www3.nd.edu/~steve/computing_with_data/17_Refining_kNN/refining_knn.html
学习笔记之k-nearest neighbors algorithm (k-NN)
原文：https://www.cnblogs.com/pegasus923/p/10417872.html
