Selective Hashing: Closing the Gap between Radius Search and k-NN Search

@inproceedings{Gao2015SelectiveHC,
  title={Selective Hashing: Closing the Gap between Radius Search and k-NN Search},
  author={Jinyang Gao and H. V. Jagadish and Beng Chin Ooi and Sheng Wang},
  booktitle={KDD},
  year={2015}
}
Locality Sensitive Hashing (LSH) and its variants, are generally believed to be the most effective radius search methods in high-dimensional spaces. However, many applications involve finding the <i>k</i> nearest neighbors (<i>k</i>-NN), where the <i>k</i>-NN distances of different query points may differ greatly and the performance of LSH suffers. We propose a novel indexing scheme called <i>Selective Hashing</i>, where a disjoint set of indices are built with different granularities and each… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

Approximate Order-Sensitive k-NN Queries over Correlated High-Dimensional Data

  • IEEE Transactions on Knowledge and Data Engineering
  • 2018
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Online Nearest Neighbor Search in Binary Space

  • 2017 IEEE International Conference on Data Mining (ICDM)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Isotropic Hashing

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Poisson processes

J.F.C. Kingman
  • volume 3. Oxford university press
  • 1992
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL