如何找到最接近的2个100维空间中以50万个点？ [英] How to find the closest 2 points in a 100 dimensional space with 500,000 points?

问题描述

我有50万个点的数据库在100维空间，我想找到最接近的2分。我该怎么做呢？

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.

推荐答案

您可以尝试在 ANN库，但是仅给出了可靠的结果高达20的尺寸。

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

这篇关于如何找到最接近的2个100维空间中以50万个点？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！