[MRG] Locality Sensitive Hashing for approximate nearest neighbor search(GSoC)

I would add a section that tells that brute force exact nearest neighbors search can be faster for small datasets but that `LSHForest` enjoys sub-linear query time scalability. The exact break even point where `LSHForest` queries become faster than the matching brute force queries dependents on the dimensionality and structure of the dataset.