A Heterogeneous High-Dimensional Approximate Nearest Neighbor Algorithm

  • Moshe Dubiner
  • Published 2012 in IEEE Transactions on Information Theory


We consider the problem of finding high-dimensional approximate nearest neighbors. We introduce an old style probabilistic formulation instead of the more general locality sensitive hashing (LSH) formulation, and show that at least for sparse problems it recognizes much more efficient algorithms than the sparseness destroying LSH random projections… (More)
DOI: 10.1109/TIT.2012.2204169


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics