New instability results for high-dimensional nearest neighbor search

From MaRDI portal
Publication:990934

DOI10.1016/J.IPL.2009.07.012zbMATH Open1209.68204arXiv0906.0684OpenAlexW2962982486MaRDI QIDQ990934FDOQ990934


Authors: J. Martínez Edit this on Wikidata


Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: Consider a dataset of n(d) points generated independently from R^d according to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)} growing sub-exponentially in d. We prove that: (i) if n(d) grows sub-exponentially in d, then, for any query point q^d in [0,1]^d and any epsilon>0, the ratio of the distance between any two dataset points and q^d is less that 1+epsilon with probability -->1 as d-->infinity; (ii) if n(d)>[4(1+epsilon)]^d for large d, then for all q^d in [0,1]^d (except a small subset) and any epsilon>0, the distance ratio is less than 1+epsilon with limiting probability strictly bounded away from one. Moreover, we provide preliminary results along the lines of (i) when f_d=N(mu_d,Sigma_d).


Full work available at URL: https://arxiv.org/abs/0906.0684




Recommendations




Cites Work


Cited In (5)





This page was built for publication: New instability results for high-dimensional nearest neighbor search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990934)