2000 character limit reached
Computing Enclosing Depth
Published 19 Feb 2024 in cs.CG | (2402.12371v1)
Abstract: Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the first algorithms to compute the enclosing depth of a query point with respect to a data point set in any dimension. In the plane we are able to optimize the algorithm to get a runtime of O(n log n). In constant dimension, our algorithms still run in polynomial time.
- Approximating the simplicial depth in high dimensions. In Proceedings of 32nd European workshop on Computational Geometry, pages 39–42, 2001.
- Duality-based approximation algorithms for depth queries and maximum depth. arXiv preprint, page arXiv:2006.12318, 2020.
- Lower bounds for computing statistical depth. Computational Statistics & Data Analysis, 40(2):223–229, 2002.
- Algorithms for bivariate medians and a fermat-torricelli problem for lines. Computational Geometry, 2003.
- Output-sensitive algorithms for tukey depth and related problems. Statistics and Computing, 18(3): 259–266, 2008.
- Absolute approximation of tukey depth: Theory and experiments. Computational Geometry, 46(5): 566–573, 2013.
- On algorithms for simplicial depth. In Proceedings of the 13th Canadian Conference of Computation Geometry (CCCG), pages 53–56, 2001.
- Classification based on the support vector machine, regression depth, and discriminant analysis. page 225–230, 2002.
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness. The Annals of Statistics, 20(4): 1803-1827 ,1992.
- Rebecka Jörnsten. Clustering and classification based on the l1 data depth. Journal of Multivariate Analysis, 90(1): 67-89, 2004.
- Regina Y. Liu. On a notion of data depth based on random simplices. The Annals of Statistics, 18(1): 405–414, 1990.
- Multivariate analysis by data depth: descriptive statistics, graphics and inference. Ann. Statist., 27(3): 783–858, 06.1999.
- Karl Mosler. Springer Berlin Heidelberg, Berlin, Heidelberg. Depth Statistics., pages 17–34, 06.1999.
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices. Discrete & Computational Geometry, 64(3): 1067–1097, 2020.
- Sachini Kanchana Rajapakse. Computing Batched Depth Queries and the Depth of a Set of Points. Faculty of Graduate Studies of The University of Manitoba Winnipeg, pages 20–26, 2022.
- Regression depth. Journal of the American Statistical Association, 94(446): 388-402, 1999.
- Bivariate location depth. Journal of the Royal Statistical Society. Series C (Applied Statistics), 45(4): 516–526, 1996.
- Computing location depth and regression depth in higher dimensions. Statistics and Computing, 8(3): 193–203, 1998.
- Computing depth contours of bivariate point clouds. Computational Statistics and Data Analysis, 23(1): 153–168, 1996.
- Patrick Schnider. Enclosing depth and other depth measures. Combinatorica, pages 1–23, 2023.
- Combinatorial depth measures for hyperplane arrangements. In 39th International Symposium on Computational Geometry (SoCG 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
- John W. Tukey. Mathematics and the picturing of data. 1975.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.