TY - GEN
T1 - Fuzzy Hamming distance: a new dissimilarity measure
AU - Bookstein, Abraham
AU - Klein, S.
AU - Raita, Timo
N1 - Place of conference:Israel
PY - 2001
Y1 - 2001
N2 - Many problems depend on a reliable measure of the distance or similarity between objects that, frequently, are represented as vectors. We consider here vectors that can be expressed as bit sequences. For such problems, the most heavily used measure is the Hamming distance, perhaps normalized. The value of Hamming distances is limited by the fact that it counts only exact matches, whereas in various applications, corresponding bits that are close by, but not exactly matched, can still be considered to be almost identical. We here define a “fuzzy Hamming distance” that extends the Hamming concept to give partial credit for near misses, and suggest a dynamic programming algorithm that permits it to be computed efficiently. We envision many uses for such a measure.
AB - Many problems depend on a reliable measure of the distance or similarity between objects that, frequently, are represented as vectors. We consider here vectors that can be expressed as bit sequences. For such problems, the most heavily used measure is the Hamming distance, perhaps normalized. The value of Hamming distances is limited by the fact that it counts only exact matches, whereas in various applications, corresponding bits that are close by, but not exactly matched, can still be considered to be almost identical. We here define a “fuzzy Hamming distance” that extends the Hamming concept to give partial credit for near misses, and suggest a dynamic programming algorithm that permits it to be computed efficiently. We envision many uses for such a measure.
UR - https://scholar.google.co.il/scholar?q=Fuzzy+Hamming+distance%3A+a+new+dissimilarity+measure&btnG=&hl=en&as_sdt=0%2C5
M3 - Conference contribution
BT - Annual Symposium on Combinatorial Pattern Matching
A2 - Amir, Amihood
PB - Springer Berlin Heidelberg
ER -