Computing the Depth of a Flat

Details Computing the Depth of a Flat Computing the Depth of a Flat

2000-09-25

arxiv.org/abs/cs/0009024v1

Computer Science

Computational Geometry

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing the Depth of a Flat does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing the Depth of a Flat, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the Depth of a Flat will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605517