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.
- P. Afshani and T. M. Chan. Optimal halfspace range reporting in three dimensions. In Proc. 20th ACM-SIAM Sympos. Discrete Algs., pages 180--186, 2009. Google Scholar
Digital Library
- P. K. Agarwal, M. de Berg, J. Matoušek, and O. Schwarzkopf. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput., 27:654--667, 1998. Google Scholar
Digital Library
- P. K. Agarwal, A. Efrat, S. Sankararaman, and W. Zhang. Nearest-neighbor searching under uncertainty. In Proc. 31st ACM Sympos. Principles Database Syst., pages 225--236, 2012. Google Scholar
Digital Library
- P. K. Agarwal, A. Efrat, and M. Sharir. Vertical decomposition of shallow levels in $3$-dimensional arrangements and its applications. SIAM J. Comput., 29:912--953, 1999. Google Scholar
Digital Library
- P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, pages 1--56. Amer. Math. Soc., 1999.Google Scholar
Cross Ref
- P. K. Agarwal and M. Sharir. Arrangements and their applications. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49--119. Elsevier, 2000.Google Scholar
- C. Aggarwal. Managing and Mining Uncertain Data. Springer-Verlag, 2009. Google Scholar
Digital Library
- P. F. Ash and E. D. Bolker. Generalized Dirichlet tessellations. Geometriae Dedicata, 20:209--243, 1986.Google Scholar
- T. Bernecker, T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Zuefle. A novel probabilistic pruning approach to speed up similarity queries in uncertain databases. In Proc. 27th IEEE Int. Conf. Data Eng., pages 339--350, 2011. Google Scholar
Digital Library
- G. Beskales, M. A. Soliman, and I. F. IIyas. Efficient search for the top-k probable nearest neighbors in uncertain databases. Proc. Int. Conf. Very Large Data., pages 326--339, 2008.Google Scholar
Digital Library
- P. Cheilaris, E. Khramtcova, and E. Papadopoulou. Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters. Technical Report 2012/03, University of Lugano, 2012.Google Scholar
- R. Cheng, J. Chen, M. Mokbel, and C. Chow. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In Proc. 24th IEEE Int. Conf. Data Eng., pages 973--982, 2008. Google Scholar
Digital Library
- R. Cheng, L. Chen, J. Chen, and X. Xie. Evaluating probability threshold k-nearest-neighbor queries over uncertain data. In Proc. 12th Int. Conf. Ext. Database Tech., pages 672--683, 2009. Google Scholar
Digital Library
- R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. IEEE Trans. Know. Data Eng., 16(9):1112--1127, 2004. Google Scholar
Digital Library
- R. Cheng, X. Xie, M. L. Yiu, J. Chen, and L. Sun. UV-diagram: A Voronoi diagram for uncertain data. In Proc. 26th IEEE Int. Conf. Data Eng., pages 796--807, 2010.Google Scholar
Cross Ref
- N. N. Dalvi, C. Ré, and D. Suciu. Probabilistic databases: Diamonds in the dirt. Commun. ACM, 52(7):86--94, 2009. Google Scholar
Digital Library
- M. de Berg, O. Cheong, M. van Kreveld, and M. H. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd edition, 2008. Google Scholar
Digital Library
- J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. Syst. Sci., 38:86--124, 1989. Google Scholar
Digital Library
- P. Gupta, R. Janardan, and M. Smid. Algorithms for generalized halfspace range searching and other intersection searching problems. Comput. Geom. Theory Appl., 5:321--340, 1996. Google Scholar
Digital Library
- S. Har-Peled. Geometric Approximation Algorithms. Mathematical Surveys and Monographs. American Mathematical Society, 2011. Google Scholar
Digital Library
- D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 194--203, 1991. Google Scholar
Digital Library
- P. Kamousi, T. M. Chan, and S. Suri. Closest pair and the post office problem for stochastic points. In Proc. 12th Workshop Algorithms Data Struct., pages 548--559, 2011. Google Scholar
Digital Library
- H.-P. Kriegel, P. Kunath, and M. Renz. Probabilistic nearest-neighbor query on uncertain objects. In Proc. 12th Int. Conf. Database Sys. Adv. App., pages 337--348, 2007. Google Scholar
Digital Library
- Y. Li, P. M. Long, and A. Srinivasan. Improved bounds on the sample complexity of learning. J. Comput. Syst. Sci., 62(3):516--527, 2001. Google Scholar
Digital Library
- V. Ljosa and A. K. Singh. APLA: Indexing arbitrary probability distributions. In Proc. 23rd IEEE Int. Conf. Data Eng., pages 946--955, 2007.Google Scholar
Cross Ref
- J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157--182, 1993.Google Scholar
Digital Library
- R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google Scholar
Digital Library
- J. Sember and W. Evans. Guaranteed Voronoi diagrams of uncertain sites. In Proc. 20th Canad. Conf. Comput. Geom., 2008.Google Scholar
- M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995. Google Scholar
Digital Library
- V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl., 16:264--280, 1971.Google Scholar
Cross Ref
- S. M. Yuen, Y. Tao, X. Xiao, J. Pei, and D. Zhang. Superseding nearest neighbor search on uncertain spatial databases. IEEE Trans. Know. Data Eng., 22(7):1041--1055, 2010. Google Scholar
Digital Library
- P. Zhang, R. Cheng, N. Mamoulis, M. Renz, A. Zufile, Y. Tang, and T. Emrich. Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. In Proc. 29th IEEE Int. Conf. Data Eng., 2013. to appear.Google Scholar
Index Terms
Nearest neighbor searching under uncertainty II
Recommendations
Nearest-Neighbor Searching Under Uncertainty II
Nearest-neighbor 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 a wide range of applications. In many of them, such as sensor databases, location-...
Nearest-neighbor searching under uncertainty
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database SystemsNearest-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, ...
Fast k-Nearest Neighbor Searching in Static Objects
The k-nearest neighbor searching is a classical problem that has been seriously studied, due to its many important applications. The paper proposes an efficient algorithm to search the k-nearest neighbors for static objects. Since locations of static ...






Comments