Academy
This page is published in English.
Distance
Chebyshev Distance - L∞ norm (maximum coordinate difference)
Distance (L∞, minimax)
Rosenfeld, A., Pfaltz, J. L.1968doi:10.1016/0031-3203(68)90013-7 ↗
Overview
d ≥ 0; d=0 iff a=b. Chebyshev Distance is symmetric.
- Output
- distance, lower is better
- Data
- Crisp, complete numeric matrix
- Size
- 2+ alternatives, 3-12 criteria works best
- Used for
- Similarity assessment, clustering
How it works
- 1
Compute the Chebyshev Distance between vectors a and b.
Roy 1991 (Chebyshev / L∞ distance; pending PDF page verification)
Edge cases and pitfalls
Only the worst-case criterion gap determines the distance - all other gaps are ignored.
Works with
Its derived weights can feed
How to cite
Rosenfeld, A.; Pfaltz, J. L. (1968). Distance functions on digital pictures. Pattern Recognition. https://doi.org/10.1016/0031-3203(68)90013-7
System ID, as it appears in reports and the API
DIST-CHEBYSHEV