Rank distance
Definition taught in Nearest neighbours, part of Statistical learning
Rank distance
| Type | Definition |
| Taught in | Nearest neighbours |
| Part | Statistical learning |
| Questions using it | 1 |
The empirical distance uses the worst coordinate, the L_\infty distance on the ranks:
\rho(x,x_i)=\max_{1\le j\le p}\bigl|r_i^{(j)}-r^{(j)}\bigr|.
Used in
- Taught in Nearest neighbours, where the derivation and examples are.
- Questions that use it (1) — Rank distance
- All 8 questions on Nearest neighbours
See also
-nearest neighbours · 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