News for hackers. Stuff that matters.

A comment on Locality-sensitive hashes are designed to cause collisions and are useful.

Re:Locality-sensitive hashes are designed to cause collision... by gms on Monday May 14, 2012 @01:10AM (#3969561)
For anyone looking to use this, please note that the benefits of LSH rapidly diminish if your nearest neighbours are in fact far away.
[ Parent | on HN ]
Re:Locality-sensitive hashes are designed to cause collision... by jandrewrogers on Monday May 14, 2012 @01:37AM (#3969637)
To add, these types of algorithms have been around for a couple decades in literature. There are reasons they are not commonly used. The concept is fine n the abstract but an implementation that does not break on real-world data sets is very difficult.
[ Parent | on HN ]
Re:Locality-sensitive hashes are designed to cause collision... by arnoldoMuller on Monday May 14, 2012 @01:59AM (#3969688)
My startup has a fast nearest neighbor engine that allows to have far matches: http://simmachines.com/Products/r01.html We hope to be the "berkeley DB" of the big data era. Feedback would be greatly appreciated!
[ Parent | on HN ]
Re:Locality-sensitive hashes are designed to cause collision... by nknight on Monday May 14, 2012 @05:12AM (#3970147)
> Feedback would be greatly appreciated!

My main piece of feedback is that explicitly comparing your product to a database engine that people love to hate is probably not a great way to market it. Lots of us have horrible memories of badly-corrupted Berkeley DB databases.

[ Parent | on HN ]
Re:Locality-sensitive hashes are designed to cause collision... by arnoldoMuller on Monday May 14, 2012 @08:48AM (#3970795)
Interesting point, thank you!
[ Parent | on HN ]