**Papers Published**

- Agarwal, PK; Aronov, B; Har-Peled, S; Phillips, JM; Yi, K; Zhang, W,
*Nearest neighbor searching under uncertainty II*, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2013), pp. 115-126

(last updated on 2018/01/20)**Abstract:**

Nearest-neighbor (NN) search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, 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 is specified as a probability distribution function. We present efficient algorithms for (i) computing all points that are nearest neighbors of a query point with nonzero probability; (ii) estimating, within a specified additive error, the probability of a point being the nearest neighbor of a query point; (iii) using it to return the point that maximizes the probability being the nearest neighbor, or all the points with probabilities greater than some threshold to be the NN. We also present some experimental results to demonstrate the effectiveness of our approach. Copyright 2013 ACM.