skip to main content
10.1145/2463664.2465219acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Nearest neighbor searching under uncertainty II

Published:22 June 2013Publication History

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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarCross RefCross Ref
  6. 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 ScholarGoogle Scholar
  7. C. Aggarwal. Managing and Mining Uncertain Data. Springer-Verlag, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. F. Ash and E. D. Bolker. Generalized Dirichlet tessellations. Geometriae Dedicata, 20:209--243, 1986.Google ScholarGoogle Scholar
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle Scholar
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarCross RefCross Ref
  16. N. N. Dalvi, C. Ré, and D. Suciu. Probabilistic databases: Diamonds in the dirt. Commun. ACM, 52(7):86--94, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. de Berg, O. Cheong, M. van Kreveld, and M. H. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd edition, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Har-Peled. Geometric Approximation Algorithms. Mathematical Surveys and Monographs. American Mathematical Society, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  22. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  24. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  25. V. Ljosa and A. K. Singh. APLA: Indexing arbitrary probability distributions. In Proc. 23rd IEEE Int. Conf. Data Eng., pages 946--955, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  26. J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157--182, 1993.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. J. Sember and W. Evans. Guaranteed Voronoi diagrams of uncertain sites. In Proc. 20th Canad. Conf. Comput. Geom., 2008.Google ScholarGoogle Scholar
  29. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. 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 ScholarGoogle ScholarCross RefCross Ref
  31. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  32. 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 ScholarGoogle Scholar

Index Terms

  1. Nearest neighbor searching under uncertainty II

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems
        June 2013
        334 pages
        ISBN:9781450320665
        DOI:10.1145/2463664
        • General Chair:
        • Richard Hull,
        • Program Chair:
        • Wenfei Fan

        Copyright © 2013 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 June 2013

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        PODS '13 Paper Acceptance Rate24of97submissions,25%Overall Acceptance Rate476of1,835submissions,26%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!