Timeline for Is there an algorithm to find the minimal number of dimensions, given the distances between points?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 30, 2019 at 5:27 | history | edited | 喜欢算法和数学 | CC BY-SA 4.0 | More explanation. |
| Jan 29, 2019 at 22:24 | comment | added | flawr | Apparently it is sufficient to hold for just one such $s$: "It is easy to show that if the result is true for one choice of s (say $s = e_i$) it is true for every valid choice of $s$." (from the original "Metric and Euclidean properties of dissimilarity coefficients" by Gower & Legendre,1986) | |
| Jan 29, 2019 at 22:24 | comment | added | flawr | Unfortunately this is an instance where the formulation of the theorem does not allow to determine whether it has to hold for one $s$ or every $s$. | |
| Jan 29, 2019 at 22:15 | comment | added | flawr | Thanks that is exactly what I'm looking for! | |
| Jan 29, 2019 at 21:59 | vote | accept | flawr | ||
| Jan 29, 2019 at 17:24 | history | edited | 喜欢算法和数学 | CC BY-SA 4.0 | added 1055 characters in body |
| Jan 29, 2019 at 16:19 | history | answered | 喜欢算法和数学 | CC BY-SA 4.0 |