For nearest neighbor problems in d-dimensional real spaces, 
, we use three popular Minkowski 
distance metrics:
| ▪ | The Manhattan ( ), |
| ▪ | The Euclidean (  ) and |
| ▪ | The Max ( ). |
A Minkowski distance metric, , in a d-dimensional real space between two vectors, 
and 
, is defined as
Eq. (1)
On the limiting case, 
, ( ), Eq. (1) reduces to
Sponsored
Try Predictive Systems Lab
Need Help?
Contact support