Document Open Access Logo

On the Separability of Stochastic Geometric Objects, with Applications

Authors Jie Xue, Yuan Li, Ravi Janardan

PDF
Thumbnail PDF

File

LIPIcs.SoCG.2016.62.pdf
  • Filesize: 0.58 MB
  • 16 pages

Document Identifiers

Author Details

Jie Xue
Yuan Li
Ravi Janardan

Cite As Get BibTex

Jie Xue, Yuan Li, and Ravi Janardan. On the Separability of Stochastic Geometric Objects, with Applications. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 62:1-62:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/LIPIcs.SoCG.2016.62

Abstract

In this paper, we study the linear separability problem for stochastic geometric objects under the well-known unipoint/multipoint uncertainty models. Let S=S_R U S_B be a given set of stochastic bichromatic points, and define n = min{|S_R|, |S_B|} and N = max{|S_R|, |S_B|}.  We show that the separable-probability (SP) of S can be computed in O(nN^{d-1}) time for d >= 3 and O(min{nN log N, N^2}) time for d=2, while the expected separation-margin (ESM) of S can be computed in O(nN^d) time for d >= 2. In addition, we give an Omega(nN^{d-1}) witness-based lower bound for computing SP, which implies the optimality of our algorithm among all those in this category. Also, a hardness result for computing ESM is given to show the difficulty of further improving our algorithm. As an extension, we generalize the same problems from points to general geometric objects, i.e., polytopes and/or balls, and extend our algorithms to solve the generalized SP and ESM problems in O(nN^d) and O(nN^{d+1}) time, respectively. Finally, we present some applications of our algorithms to stochastic convex-hull related problems.

Subject Classification

Keywords
  • Stochastic objects
  • linear separability
  • separable-probability
  • expected separation-margin
  • convex hull

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. P.K. Agarwal, B. Aronov, S. Har-Peled, J.M. Phillips, K. Yi, and W. Zhang. Nearest neighbor searching under uncertainty II. In Proceedings of the 32nd Symposium on Principles of Database Systems, pages 115-126. ACM, 2013. Google Scholar
  2. P.K. Agarwal, S-W. Cheng, Y. Tao, and K. Yi. Indexing uncertain data. In Proceedings of the Twenty-eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 137-146. ACM, 2009. Google Scholar
  3. P.K. Agarwal, S-W. Cheng, and K. Yi. Range searching on uncertain data. ACM Transactions on Algorithms (TALG), 8(4):43, 2012. Google Scholar
  4. P.K. Agarwal, S. Har-Peled, S. Suri, H. Yıldız, and W. Zhang. Convex hulls under uncertainty. In Algorithms-ESA 2014, pages 37-48. Springer, 2014. Google Scholar
  5. C.C. Aggarwal and P.S. Yu. A survey of uncertain data algorithms and applications. IEEE Transactions on Knowledge and Data Engineering, 21(5):609-623, 2009. Google Scholar
  6. A. Agrawal, Y. Li, J. Xue, and R. Janardan. The most-likely skyline problem for stochastic points. Submitted to a journal, 2015. Google Scholar
  7. N. Dalvi, C. Ré, and D. Suciu. Probabilistic databases: diamonds in the dirt. Communications of the ACM, 52(7):86-94, 2009. Google Scholar
  8. M. de Berg, A.D. Mehrabi, and F. Sheikhi. Separability of imprecise points. In Algorithm theory - SWAT 2014, volume 8503 of LNCS, pages 146-157. Springer, 2014. Google Scholar
  9. M. de Berg, M. van Kreveld, M. Overmars, and O.C. Schwarzkopf. Computational Geometry. Springer, 2000. Google Scholar
  10. H. Edelsbrunner and L.J. Guibas. Topologically sweeping an arrangement. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 389-403, 1986. Google Scholar
  11. M. Fink, J. Hershberger, N. Kumar, and Suri S. Hyperplane separability and convexity of probabilistic points. 32nd International Symposium on Computational Geometry, 2016. Google Scholar
  12. P. Kamousi, T.M. Chan, and S. Suri. Stochastic minimum spanning trees in euclidean spaces. In Proceedings of the Twenty-seventh Annual Symposium on Computational geometry, pages 65-74. ACM, 2011. Google Scholar
  13. Y. Li, J. Xue, A. Agrawal, and R. Janardan. On the arrangement of stochastic lines in ℝ². Submitted to a journal, 2015. Google Scholar
  14. M. Löffler. Data imprecision in computational geometry. PhD thesis, Utrecht Univ., 2009. Google Scholar
  15. M. Löffler and M. van Kreveld. Largest and smallest convex hulls for imprecise points. Algorithmica, 56(2):235-269, 2010. Google Scholar
  16. S. Suri and K. Verbeek. On the most likely Voronoi Diagram and nearest neighbor searching. In Algorithms and Computation, pages 338-350. Springer, 2014. Google Scholar
  17. S. Suri, K. Verbeek, and H. Yıldız. On the most likely convex hull of uncertain points. In Algorithms-ESA 2013, pages 791-802. Springer, 2013. Google Scholar
  18. J. Xue, Y. Li, and R. Janardan. On the separability of stochastic geometric objects, with applications. (Full version). ArXiv:1603.07021 [cs.CG], 2016. Google Scholar
  19. W. Zhang. Nearest-neighbor searching under uncertainty. PhD thesis, Duke Univ., 2012. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact