algorithmperformancenearest-neighborpcaapproximate-nn-searching

How to find the closest 2 points in a 100 dimensional space with 500,000 points?

I have a database with 500,000 points in a 100 dimensional space, and I want to find the closest 2 points. How do I do it?

Update: Space is Euclidean, Sorry. And thanks for all the answers. BTW this is not homework.

Solution

  • You could try the ANN library, but that only gives reliable results up to 20 dimensions.