Experiment with binary trees

pixelogik / NearPy

Python framework for fast (approximated) nearest neighbour search in large, high-dimensional data sets using different locality-sensitive hashes.

MIT License

759 stars 152 forks source link

Closed pixelogik closed 9 years ago

pixelogik commented 9 years ago

This would guarantee to always get N results.

pixelogik commented 9 years ago

Added RandomBinaryProjectionTree for this.