search

pixelogik / NearPy

Python framework for fast (approximated) nearest neighbour search in large, high-dimensional data sets using different locality-sensitive hashes.
MIT License
763 stars 151 forks source link

Use Hilbert space filling curve? #79

Open uriva opened 6 years ago

uriva commented 6 years ago

I'm curious about the choice of random binary projections versus Hilbert curve. Does rbp outperform it?

Would it make sense to add another hasher?

pixelogik commented 6 years ago

@uriva I have no experience with using Hilbert curves in this application.

If you are interested in adding a hilbert curve based hash to NearPy feel free to do so :) Would be highly appreciated.