Abstract
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 eficiently. We envision many uses for such a measure.
| Original language | English |
|---|---|
| Title of host publication | Combinatorial Pattern Matching - 12th Annual Symposium, CPM 2001, Proceedings |
| Editors | Amihood Amir, Amihood Amir, Gad M. Landau, Gad M. Landau |
| Publisher | Springer Verlag |
| Pages | 86-97 |
| Number of pages | 12 |
| ISBN (Print) | 3540422714, 9783540422716 |
| DOIs | |
| State | Published - 2001 |
| Event | 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001 - Jerusalem, Israel Duration: 1 Jul 2001 → 4 Jul 2001 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2089 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001 |
|---|---|
| Country/Territory | Israel |
| City | Jerusalem |
| Period | 1/07/01 → 4/07/01 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2001.