hamming(u, v, w=None)
The Hamming distance between 1-D arrays u and v, is simply the proportion of disagreeing components in u and v. If u and v are boolean vectors, the Hamming distance is
where $c_{ij}$ is the number of occurrences of $\mathtt{u[k]} = i$ and $\mathtt{v[k]} = j$ for $k < n$ .
Input array.
Input array.
The weights for each value in u and v. Default is None, which gives each value a weight of 1.0
Compute the Hamming distance between two 1-D arrays.
>>> from scipy.spatial import distance
... distance.hamming([1, 0, 0], [0, 1, 0]) 0.66666666666666663
>>> distance.hamming([1, 0, 0], [1, 1, 0]) 0.33333333333333331
>>> distance.hamming([1, 0, 0], [2, 0, 0]) 0.33333333333333331
>>> distance.hamming([1, 0, 0], [3, 0, 0]) 0.33333333333333331See :
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.spatial.distance.hamming
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them