Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Conference paper
Abstract
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in ℝ2. These include Tukey depth [15], Oja depth [12], Simplicial depth [10] and several others. Recently Fox et al. [7] have defined the Ray-Shooting depth of a point set, and given a topological proof for the existence of points with high Ray-Shooting depth in ℝ2. In this paper, we present an O(n 2 log 2 n)-time algorithm for computing a point of high Ray-Shooting depth. We also present a linear time approximation algorithm.
Keywords
Input Point Range Space Good Cone Simplicial Depth Statistical Computing Software
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Basit, A., Mustafa, N.H., Ray, S., Raza, S.: Centerpoints and tverberg’s technique. Computational Geometry: Theory and Applications 43(7), 593–600 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
- 2.Basit, A., Mustafa, N.H., Ray, S., Raza, S.: Hitting simplices with points in ℝ3. Discrete & Computational Geometry 44(3), 637–644 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
- 3.Boros, E., Füredi, Z.: The number of triangles covering the center of an n-set. Geometriae Dedicata 17(1), 69–77 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
- 4.Chan, T.M.: An optimal randomized algorithm for maximum tukey depth. In: SODA, pp. 430–436 (2004)Google Scholar
- 5.Chazelle, B.: The Discrepancy Method. Cambridge University Press, Cambridge (2000)CrossRefzbMATHGoogle Scholar
- 6.Cole, R., Salowe, J.S., Steiger, W.L., Szemerédi, E.: An optimal-time algorithm for slope selection. SIAM J. Comput. 18(4), 792–810 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
- 7.Fox, J., Gromov, M., Lafforgue, V., Naor, A., Pach, J.: Overlap properties of geometric expanders. In: SODA (2011)Google Scholar
- 8.Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. In: Symposium on Computational Geometry, pp. 83–90 (1993)Google Scholar
- 9.Langerman, S., Steiger, W.L.: Optimization in arrangements. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 50–61. Springer, Heidelberg (2003)CrossRefGoogle Scholar
- 10.Liu, R.: A notion of data depth based upon random simplices. The Annals of Statistics 18, 405–414 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
- 11.Mustafa, N.H., Ray, S.: An optimal extension of the centerpoint theorem. Computational Geometry: Theory and Applications 42(7), 505–510 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
- 12.Oja, H.: Descriptive statistics for multivariate distributions. Statistics and Probability Letters 1, 327–332 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
- 13.Rado, R.: A theorem on general measure. J. London. Math. Soc. 21, 291–300 (1947)MathSciNetzbMATHGoogle Scholar
- 14.Rousseeuw, P.J., Ruts, I.: Constructing the bivariate tukey median. Statistica Sinica 8, 827–839 (1998)MathSciNetzbMATHGoogle Scholar
- 15.Tukey, J.: Mathematics and the picturing of data. In: Proc. of the International Congress of Mathematicians, pp. 523–531 (1975)Google Scholar
- 16.Vardi, Y., Zhang, C.: The multivariate L1-median and associated data depth. Proceedings of the National Academy of Sciences of the United States of America 97(4), 14–23 (2000)CrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2011