In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius R in d dimensional space equipped with lp norm when p ∈ [1, ∞]. Furthermore, we show how to use these hash functions to solve the c-approximate nearest neighbor search problem without false negatives. Namely, if there is a point at distance R, we will certainly report it and points at distance greater than cR will not be reported for c = Ω( √ d, d 1− 1 p ). The constructed algorithms work: • with preprocessing time O(n log(n)) and sublinear expected query time, • with preprocessing time O(poly(n)) and expected query time O(log(n)). Our paper reports progress on answering the open problem presented by Pagh [8], who considered the nearest neighbor search without false negatives for the Hamming distance.
Pacuk et al. REF presented a schema for solving the nearest neighbor without false negatives for any p ∈ [1, ∞] for c = Ω(d max{1/2,1−1/p} ).
Locality-Sensitive Hashing without False Negatives for l_p
Computing and Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, pages 105--118
Mathematics Computer Science