Corpus ID: 25332147

Improved approximate near neighbor search without false negatives for $l_2$

@article{Wygocki2017ImprovedAN,
  title={Improved approximate near neighbor search without false negatives for \$l_2\$},
  author={Piotr Wygocki},
  journal={ArXiv},
  year={2017},
  volume={abs/1709.10338}
}
  • Piotr Wygocki
  • Published 2017
  • Mathematics, Computer Science
  • ArXiv
  • We present a new algorithm for the $c$--approximate nearest neighbor search without false negatives for $l_2^d$. We enhance the dimension reduction method presented in \cite{wygos_red} and combine it with the standard results of Indyk and Motwani~\cite{motwani}. We present an efficient algorithm with Las Vegas guaranties for any $c>1$. This improves over the previous results, which require $c=\omega(\log\log{n})$ \cite{wygos_red}, where $n$ is the number of the input points. Moreover, we… CONTINUE READING

    References

    SHOWING 1-10 OF 15 REFERENCES
    On fast bounded locality sensitive hashing
    • 3
    • PDF
    Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
    • 1,008
    • PDF
    Optimal Las Vegas Locality Sensitive Data Structures
    • Thomas Dybdahl Ahle
    • Physics, Computer Science
    • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2017
    • 16
    • PDF
    Approximate range searching in higher dimension
    • 23
    • PDF
    Two algorithms for nearest-neighbor search in high dimensions
    • 419
    • PDF
    On approximate nearest neighbors in non-Euclidean spaces
    • P. Indyk
    • Mathematics, Computer Science
    • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
    • 1998
    • 54
    Locality-sensitive Hashing without False Negatives
    • R. Pagh
    • Mathematics, Computer Science
    • SODA
    • 2016
    • 43
    • PDF
    Optimal Data-Dependent Hashing for Approximate Near Neighbors
    • 187
    • PDF
    An algorithm for approximate closest-point queries
    • 135