Let me rephrase this to make it clearer: > Indeed, but they use random projections rather than LSH.
It is my understanding that Annoy implements ANN hashing by using a data-driven forests of Random Projections rather than (data independent) uniformly distributed RPs to bucket the samples as vanilla LSH does. Both LSH and Annoy-Tree-LSH are hashing schemes, but Annoy is focusing on high density regions of the dataset, hence problem more efficient. -- Olivier ------------------------------------------------------------------------------ Learn Graph Databases - Download FREE O'Reilly Book "Graph Databases" is the definitive new guide to graph databases and their applications. Written by three acclaimed leaders in the field, this first edition is now available. Download your free book today! http://p.sf.net/sfu/13534_NeoTech _______________________________________________ Scikit-learn-general mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
