2. CLANN
Overview
Given a dataset S ⊆ X and an integer k ≥ 1, the (k, δ) nearest neighbor problem ((k, δ)-NN) is to build a data structure, such that for every query q ∈ X, the query algorithm returns a set of k distinct points, each one being with probability at least 1 − δ among the k points in S closest to q — Aumüller, Martin, Tobias Christiani, Rasmus Pagh, e Michael Vesterli. «PUFFINN: Parameterless and Universally Fast Finding of Nearest Neighbors». arXiv, 28 giugno 2019. https://doi.org/10.48550/arXiv.1906.12211.