Nearest-Neighbor Searching Under Uncertainty I

Pankaj K. Agarwal, Alon Efrat, Swaminathan Sankararaman, Wuzhou Zhang

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

Nearest-neighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in many fields because of a wide range of applications. In many of these applications, such as sensor databases, location based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest-neighbor queries in a probabilistic framework in which the location of each input point and/or query point is specified as a probability density function and the goal is to return the point that minimizes the expected distance, which we refer to as the expected nearest neighbor (ENN). We present methods for computing an exact ENN or an ε-approximate ENN , for a given error parameter 0 < ε< 1 , under different distance functions. These methods build a data structure of near-linear size and answer ENN queries in polylogarithmic or sublinear time, depending on the underlying function. As far as we know, these are the first nontrivial methods for answering exact or ε-approximate ENN queries with provable performance guarantees. Moreover, we extend our results to answer exact or ε-approximate k-ENN queries.

Original languageEnglish (US)
Pages (from-to)705-745
Number of pages41
JournalDiscrete and Computational Geometry
Volume58
Issue number3
DOIs
StatePublished - Oct 1 2017

    Fingerprint

Keywords

  • Approximate nearest neighbor (ANN)
  • Nearest-neighbor queries
  • Queries on uncertain data

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this