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

Given that in K(A)NN classification we don't need the actual nearest data points so much as a vote over their classes, can we offer the user to save time by not computing the true distances?