One weakness of the basic Euclidean and Manhattan distance functions is that if one of the input variables
has a relatively large range, then it can overpower the other input variables. For example, suppose an
application has just two input attributes, f and g. If f can have values from 1 to 1000 and g has values only
from 1 to 10, then g’s influence on the distance function will usually be overpowered by f’s influence