ABCDepth: efficient algorithm for Tukey depth
Milica Bogicevic, Milan Merkle

TL;DR
This paper introduces ABCDepth, an efficient algorithm for computing Tukey depth level sets in high-dimensional data, utilizing intersections of balls, and demonstrates its superior speed and scalability over existing methods.
Contribution
The paper presents a novel algorithm for Tukey depth level sets based on intersections of balls, with improved computational complexity and scalability for high-dimensional data.
Findings
Algorithm is significantly faster than existing methods.
Can handle thousands of multidimensional observations.
Effective for high-dimensional data analysis.
Abstract
We present a new algorithm for Tukey (halfspace) depth level sets and its implementation. Given -dimensional data set for any , the algorithm is based on representation of level sets as intersections of balls in , and can be easily adapted to related depths (Type D, Zuo and Serfling (Ann. Stat. {\bf 28} (2000), 461--482)). The algorithm complexity is where is the data set size. Examples with real and synthetic data show that the algorithm is much faster than other implemented algorithms and that it can accept thousands of multidimensional observations, while other algorithms are tested with two-dimensional data or with a couple of hundreds multidimensional observations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Statistical Methods and Models · Advanced Statistical Process Monitoring · Statistical Methods and Inference
