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

Sure, but the problem is that `check_random_state` is run for each tree, so it constructs a new random generator for the *same seed* (if `random_state` is a seed and not a RNG or `None`), i.e. the same random projection matrix for each hash.