Questions tagged [hamming-distance]

the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different.

The Hamming distance between two strings or vectors (of equal length) is the number of positions in which the two differ. It is a true distance (it is symmetric, definite, and satisfies the triangle inequality). This distance originates, and frequently is used in, information theory, coding theory, and cryptography.

https://en.wikipedia.org/wiki/Hamming_distance

4 questions
1
vote
0 answers

Comparison of Similarity Measures

Could anyone explain in simple words (and maybe with an example) What are the differences between Hamming Distance, Jaro, and Monge-Elkan in terms of quality data matching through the string similarity?
0
votes
1 answer

Hamming distance, ignoring matching 0

I have a dataset with about 800 observations, each with about 2000 boolean variables. I would like to cluster the observations. I am using scipy in Python. For a (dis)similarity measure I've chosen the "Hamming" method, since it seems specifically…
0
votes
0 answers

How does the concept of random covariability compare between complexity theory and discrete estimation theory?

Given a pair of permutations of the integers between 1 and $n$, inclusive, one could compute both a metric of Fisher (parameter) information, like Spearman's rho, or a metric of conditional complexity, like Hamming distance. If we assume the…
0
votes
0 answers

Clustering items taking values from a discrete set

The problem setup is as follows: There a $N$ items which have to be clustered into $K$ clusters. Each Items has a certain number of dependencies, where each item takes dependencies from a discrete set $\mathbb{A}$. Each item can take 1 to…