Timeline for Alternative distance to Dynamic Time Warping
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 28, 2018 at 6:19 | comment | added | Ripstein | I agree on the point @SFTP made, I don't see why a PAM with Euclidean distance (a real distance) wouldn't give us the clusters you proposed, taking Lisabeth and Maryann as the 2 medoids. | |
| Mar 27, 2018 at 19:05 | comment | added | user380 | The bold paragraph is false. Define d(x, y) to be the length of shortest chain of words from the given word set where two words are connected if one is a substring of the other. If there is no such chain, let d(x, y) be the total number of words in the set. This is a metric (triangle inequality holds) and it clusters the names in your example exactly as expected. Metrics don't have to be based on counting characters. Also, this does not address the actual question. | |
| Mar 27, 2018 at 17:50 | review | First posts | |||
| Mar 27, 2018 at 17:51 | |||||
| Mar 27, 2018 at 17:48 | history | answered | Eamonn Keogh | CC BY-SA 3.0 |