Computes the Hamming distance between two n-vectors u and v, which is simply the proportion of disagreeing components in u and v. If u and v are boolean vectors, the Hamming distance is
\frac{c_{01} + c_{10}}{n}
where c_{ij} is the number of occurrences of \mathtt{u[k]} = i and \mathtt{v[k]} = j for k < n.
Parameters : | u : ndarray
v : ndarray
|
---|---|
Returns : | d : double
|