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

Oops. I just pushed without seeing this comment. 
However there is another issue with candidates. We can surely use random set of candidates if there 0 candidates were selected. But selected number of candidates may be less than the requested number of neighbors. Here I only used a user warning for such situation. How can we address this better?