Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
What we’re doing in effect: solving the K-nearest neighbor problem for a query vector
In general, we do not know how to do this efficiently for high-dimensional spaces
But it is solvable for short queries, and standard indexes support this well
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License