Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings

Abstract

While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ1, few non-trivial algorithms are known for ℓp when 2<p<∞. In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the best known approximation factor guarantees in this setting.