4 ms·
Data structure for Nearest Neighbor Search - VP Trees
- BigZaphod 15y agoI'm no expert, but this doesn't seem to be any significantly better than a k-d tree, does it? I might be missing something. I find academic papers hard to parse.
- pork 15y agoDon't waste your time on space partitioning trees if you have big data, jump straight to Locality Sensitive Hashing or approximate nearest neighbor graph construction (WWW 2011)
- arnoldoMuller 15y agoThis is a very important data structure from a historical point of view, but unfortunately it doesn't work well when you are dealing with complex spaces. Try LSH as mentioned before or something that is 10X faster: http://simmachines.com http://simmachines.com