-nearest neighbours
Definition taught in Nearest neighbours, part of Statistical learning
-nearest neighbours
| Type | Definition |
| Taught in | Nearest neighbours |
| Part | Statistical learning |
| Questions using it | 6 |
Given a metric, order the training points by increasing distance from a query x. The 1-nearest-neighbour rule predicts the label of the closest training point. The k-nearest-neighbour rule predicts the majority label among the k closest. A soft version uses the class proportions in that neighbourhood as an estimate of \tau_g(x).
Used in
- Taught in Nearest neighbours, where the derivation and examples are.
- Also used in Classes, recurrence, and reversibility · Hierarchical clustering and kernel density estimation · Estimating error rates · Classification trees
- Questions that use it (6) — Changing units (answer) · Rank distance · The factor of two · Normalisation and nearest neighbours · Tuning a nearest-neighbour classifier · What an accuracy table does and does not say
- All 8 questions on Nearest neighbours
See also
Single, complete, and average linkage · Rank distance · Bayes consistency of -nearest neighbours · Distance and scale in nearest neighbours · Ties and the choice of k · Consistency and the factor of two · Laboratory: what a distance metric changes · Cover–Hart bound