skip to main content
announcement

Computing the Expected Value and Variance of Geometric Measures

Published:18 July 2018Publication History
Skip Abstract Section

Abstract

Let P be a point set in ℝd, and let M be a function that maps any subset of P to a positive real. We examine the problem of computing the mean and variance of M when a subset in P is selected according to a random distribution. We consider two distributions; in the first distribution (the Bernoulli distribution), each point p in P is included in the random subset independently, with probability π(p). In the second distribution (the fixed-size distribution), exactly s points are selected uniformly at random among all possible subsets of s points in P.

We present efficient algorithms for computing the mean and variance of several geometric measures when point sets are selected under one of the described random distributions. We also implemented four of those algorithms: an algorithm that computes the mean 2D bounding box volume in the Bernoulli distribution, an algorithm for the mean 2D convex hull area in the fixed-size distribution, an algorithm that computes the exact mean and variance of the mean pairwise distance (MPD) for d-dimensional point sets in the fixed-size distribution, and an (1 − ε)-approximation algorithm for the same measure. We conducted experiments where we compared the performance of our implementations with a standard heuristic approach, and we show that our implementations are very efficient. We also compared the implementation of our exact MPD algorithm and the (1 − ε)-approximation algorithm; the approximation method performs faster on real-world datasets for point sets of up to 13 dimensions, and provides high-precision approximations.

References

  1. P. K. Agarwal, S. Har-Peled, S. Suri, H. Yıldız, and W. Zhang. 2014. Convex hulls under uncertainty. In European Symposium on Algorithms. Springer, 37--48.Google ScholarGoogle Scholar
  2. Kfir Barhum, Oded Goldreich, and Adi Shraibman. 2007. On Approximating the Average Distance Between Points. Springer, Berlin, 296--310.Google ScholarGoogle Scholar
  3. A. K. Brunbjerg, J. Cavender-Bares, W. L. Eiserhardt, R. Ejrnæs, L. W. Aarssen, H. L. Buckley, E. Forey, F. Jansen, J. Kattge, C. Lane, R. A. Lubke, A. T. Moles, A. L. Monserrat, R. K. Peet, J. Roncal, L. Wootton, and J.-C. Svenning. 2014. Multi-scale phylogenetic structure in coastal dune plant communities across the globe. Journal of Plant Ecology (2014). arXiv:http://jpe.oxfordjournals.org/content/early/2014/01/28/jpe.rtt069.full.pdf+htmlGoogle ScholarGoogle Scholar
  4. Benno Büeler, Andreas Enge, and Komei Fukuda. 2000. Exact Volume Computation for Polytopes: A Practical Study. Birkhäuser, Basel, 131--154.Google ScholarGoogle Scholar
  5. P. B. Callahan and S. R. Kosaraju. 1995. A decomposition of multidimensional point sets with applications to K-nearest-neighbors and N-body potential fields. J. ACM 42, 1 (Jan. 1995), 67--90. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. W. K. Cornwell, D. W. Schwilk, and D. D. Ackerly. 2006. A trait-based test for habitat filtering: Convex hull volume. Ecology 87, 6 (2006), 1465--1471.Google ScholarGoogle ScholarCross RefCross Ref
  7. M. Fink, J. Hershberger, N. Kumar, and S. Suri. 2016. Hyperplane separability and convexity of probabilistic point sets. In Proceedings of the 32nd International Symposium on Computational Geometry (SoCG’16). 38:1--38:16.Google ScholarGoogle Scholar
  8. Nicholas J. Gotelli. 2000. Null model analysis of species co-occurrence patterns. Ecology 81, 9 (2000), 2606--2621.Google ScholarGoogle ScholarCross RefCross Ref
  9. J. C. Gower. 1971. A general coefficient of similarity and some of its properties. Biometrics (1971), 857--871.Google ScholarGoogle Scholar
  10. Ronald L. Graham. 1972. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1, 4 (1972), 132--133.Google ScholarGoogle ScholarCross RefCross Ref
  11. W. Hoeffding. 1963. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58, 301 (1963), 13--30.Google ScholarGoogle ScholarCross RefCross Ref
  12. Lingxiao Huang and Jian Li. 2015. Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points. Springer, Berlin, 910--921.Google ScholarGoogle Scholar
  13. A. Jørgensen, M. Löffler, and J. M. Phillips. 2011. Geometric computations on indecisive points. In Workshop on Algorithms and Data Structures. Springer, 536--547. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. B. Lasserre. 1983. An analytical expression and an algorithm for the volume of a convex polyhedron in R<sup>n</sup>. Journal of Optimization Theory and Applications 39, 3 (1983), 363--377.Google ScholarGoogle ScholarCross RefCross Ref
  15. Chao Li, Chenglin Fan, Jun Luo, Farong Zhong, and Binhai Zhu. 2015. Expected computations on color spanning sets. Journal of Combinatorial Optimization 29, 3 (2015), 589--604. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. L. Huang, J. Li, J. M. Phillips, and H. Wang. 2016. Epsilon-kernel coresets for stochastic points. Retrieved July 7, 2018 from https://arxiv.org/abs/1411.0194.Google ScholarGoogle Scholar
  17. Maarten Löffler and Jeff M. Phillips. 2009. Shape fitting on point sets with probability distributions. In Proceedings of the 17th Annual European Symposium on Algorithms (ESA’09). Springer, Berlin. 313--324.Google ScholarGoogle Scholar
  18. Maarten Löffler and Marc van Kreveld. 2010. Largest and smallest convex hulls for imprecise points. Algorithmica 56, 2 (Feb. 2010), 235--269.Google ScholarGoogle ScholarCross RefCross Ref
  19. Norman W. H. Mason, Pascal Irz, Cédric Lanoiselée, David Mouillot, and Christine Argillier. 2008. Evidence that niche specialization explains species--Energy relationships in lake fish communities. Journal of Animal Ecology 77, 2 (2008), 285--296.Google ScholarGoogle ScholarCross RefCross Ref
  20. M. A Mouchet, S. Villéger, N. W. H. Mason, and D. Mouillot. 2010. Functional diversity measures: An overview of their redundancy and their ability to discriminate community assembly rules. Functional Ecology 24, 4 (2010), 867--876.Google ScholarGoogle ScholarCross RefCross Ref
  21. S. Suri, K. Verbeek, and H. Yıldız. 2013. On the most likely convex hull of uncertain points. In European Symposium on Algorithms. Springer, 791--802.Google ScholarGoogle Scholar
  22. N. G. Swenson and M. D. Weiser. 2014. On the packing and filling of functional space in eastern North American tree assemblages. Ecography 37, 11 (2014), 1056--1062.Google ScholarGoogle Scholar
  23. C. Tsirogiannis. 2016. GitHub Repository of Geometric-Measure Statistics Code. Retrieved July 7, 2018 from https://github.com/constantinosTsirogiannis/GeometryStats.Google ScholarGoogle Scholar
  24. S. Villéger, N. W. H. Mason, and D. Mouillot. 2008. New multidimensional functional diversity indices for a multifaceted framework in functional ecology. Ecology 89, 8 (2008), 2290--2301.Google ScholarGoogle ScholarCross RefCross Ref
  25. B. Walker, A. Kinzig, and J. Langridge. 1999. Plant attribute diversity, resilience, and ecosystem function: The nature and significance of dominant and minor species. Ecosystems 2 (1999), 95--113.Google ScholarGoogle ScholarCross RefCross Ref
  26. Jie Yang, Nathan G. Swenson, Guocheng Zhang, Xiuqin Ci, Min Cao, Liqing Sha, Jie Li, J. W. Ferry Slik, and Luxiang Lin. 2015. Local-scale partitioning of functional and phylogenetic beta diversity in a tropical tree assemblage. Scientific Reports 5 (2015), 12731.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Computing the Expected Value and Variance of Geometric Measures

        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

        Full Access

        • Published in

          cover image ACM Journal of Experimental Algorithmics
          ACM Journal of Experimental Algorithmics  Volume 23, Issue
          Special Issue ALENEX 2017
          2018
          368 pages
          ISSN:1084-6654
          EISSN:1084-6654
          DOI:10.1145/3178547
          Issue’s Table of Contents

          Copyright © 2018 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 18 July 2018
          • Accepted: 1 March 2018
          • Revised: 1 February 2018
          • Received: 1 May 2017
          Published in jea Volume 23, Issue

          Qualifiers

          • announcement
          • Research
          • Refereed
        • Article Metrics

          • Downloads (Last 12 months)11
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader