Timeline for Finding similar high dimensional real vectors
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Aug 4, 2015 at 3:34 | vote | accept | AdrianGW | ||
| Aug 4, 2015 at 2:56 | history | tweeted | twitter.com/#!/StackCompSci/status/628399152494440448 | ||
| Aug 4, 2015 at 1:38 | comment | added | vzn | optimization strategies will tend to vary based on the distribution of your data (eg natural clustering which is often present, although maybe not). do you have some way of estimating/ quantifying it? one std area to look into, octrees | |
| Aug 4, 2015 at 1:33 | comment | added | vonbrand | To round (or more generally, to classify each dimention into bins) is essentially cutting up the space into cubes (paralellepipeds, i.e., bricks). Same brick means they are not too far apart, but they could be in different bricks but very near (i.e,, almost on the boundary between bricks). Without lot more details, we can't know if this is a problem or not. You could also try to sort on one of the dimensions, and check the other one(s) for "nearby" ones only, using the same idea if there are several dimensions. | |
| Aug 3, 2015 at 23:42 | answer | added | D.W.♦ | timeline score: 2 | |
| Aug 3, 2015 at 23:10 | review | First posts | |||
| Aug 4, 2015 at 1:34 | |||||
| Aug 3, 2015 at 23:05 | history | asked | AdrianGW | CC BY-SA 3.0 |