Timeline for Quick search the most similar objects in the n-dimensional space
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2017 at 4:56 | vote | accept | konstantin_doncov | ||
| Feb 10, 2017 at 19:29 | answer | added | Evan Carroll | timeline score: 3 | |
| Dec 21, 2016 at 17:22 | comment | added | Rick James | See also stackoverflow.com/questions/41245001/… | |
| Dec 20, 2016 at 23:03 | answer | added | Rick James | timeline score: 1 | |
| Dec 20, 2016 at 14:33 | comment | added | konstantin_doncov | @AndriyM I know but it will take a lot of time for big dataset, and we don't need so high accuracy | |
| Dec 20, 2016 at 13:59 | comment | added | Andriy M |
Mathematically, the (Euclidean) distance would actually be calculated as SQRT((c1-$myc1)^2 + (c2-$myc2)^2 + …).
|
|
| Dec 20, 2016 at 4:02 | review | First posts | |||
| Dec 20, 2016 at 8:03 | |||||
| Dec 20, 2016 at 3:56 | history | asked | konstantin_doncov | CC BY-SA 3.0 |