Timeline for Distance Metrics For Binary Vectors
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2019 at 12:49 | answer | added | Charly Empereur-mot | timeline score: 4 | |
| Oct 31, 2016 at 20:13 | comment | added | whuber♦ | @Peter Actually, it's not that either. Assuming you mean sum of absolute values of the differences (without which you cannot have a distance at all), you have described the L1 distance. The Hamming distance is the number of places in which the two vectors differ. | |
| Oct 31, 2016 at 17:22 | answer | added | chad39 | timeline score: 7 | |
| Nov 11, 2014 at 20:29 | answer | added | arinarmo | timeline score: 15 | |
| May 11, 2013 at 12:34 | comment | added | Peter Flom | You seem to have defined Hamming distance incorrectly. It is not the sum of one minus the sum of the other it is the sum of the differences. | |
| May 11, 2013 at 12:10 | comment | added | totpiko | Well "correct" data you mean if I can then say this was correct and this wasn't. Nope I do not have, I am trying to find the best metrics on it. | |
| May 11, 2013 at 12:01 | comment | added | N. McA. | Do you have the "correct" data to CV with? | |
| May 11, 2013 at 11:52 | comment | added | totpiko | any suggestion which distance would be more useful? | |
| May 11, 2013 at 11:51 | comment | added | ziggystar | How about edit distance? | |
| May 11, 2013 at 11:12 | history | asked | totpiko | CC BY-SA 3.0 |