Computing the Depth of a Flat

2000/09/25 by Marshall Bern, Bern, Marshall, David Eppstein +1
Computer Science · Decision Sciences · Mathematics · #Advanced Statistical Methods and Models #Advanced Statistical Process Monitoring #Computational Geometry and Mesh Generation #cs.CG

paper · pdf · doi:10.48550/arxiv.cs/0009024

6 pages, 1 figure, 2-page version to appear in ACM/SIAM SODA 2001

arxiv created 2000/09/25 · arxiv updated 2009/11/30

Abstract

We give algorithms for computing the regression depth of a k-flat for a set of n points in R^d. The running time is O(n^(d-2) + n log n) when 0 < k < d-1, faster than the best time bound for hyperplane regression or for data depth.

Related

• Computation of projection regression depth and its induced median
• Approximate computation of projection depths
• Curve Stabbing Depth: Data Depth for Plane Curves
• Statistical depth meets computational geometry: a short survey
• Approximating Majority Depth