Computing the Depth of a Flat
classification
💻 cs.CG
keywords
depthcomputingregressiontimealgorithmsbestbounddata
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.