Fast GPU-based locality sensitive hashing for k-nearest neighbor computation

@inproceedings{Pan2011FastGL,
  title={Fast GPU-based locality sensitive hashing for k-nearest neighbor computation},
  author={Jia Pan and Dinesh Manocha},
  booktitle={GIS},
  year={2011}
}
We present an efficient GPU-based parallel LSH algorithm to perform approximate k-nearest neighbor computation in high-dimensional spaces. We use the Bi-level LSH algorithm, which can compute k-nearest neighbors with higher accuracy and is amenable to parallelization. During the first level, we use the parallel RP-tree algorithm to partition datasets into several groups so that items similar to each other are clustered together. The second level involves computing the Bi-Level LSH code for each… CONTINUE READING

7 Figures & Tables

Topics

Statistics

010202012201320142015201620172018
Citations per Year

78 Citations

Semantic Scholar estimates that this publication has 78 citations based on the available data.

See our FAQ for additional information.