Locality sensitive hashing Essays

  • Increasing Size Of Data Size

    1023 Words  | 3 Pages

    efficient than the exact ones, even though their query time and/or space usage is still exponential in the dimension. The approximate nearest neighbor algorithm can be best implemented using data structures like basic knn, Kd trees and locality sensitive hashing. 1.5 Approaches followed This report includes the three approximate nearest neighbor algorithms, the study, implementation and the results and applications related to these three algorithms:  Basic Knn Algorithm  KD Tree Algorithm  LSH