Computer Science – Computational Geometry
Scientific paper
1999-12-20
Discrete Comput. Geom. 28(1):1-17, July 2002
Computer Science
Computational Geometry
12 pages, 3 figures
Scientific paper
10.1007/s00454-001-0092-1
The regression depth of a hyperplane with respect to a set of n points in R^d is the minimum number of points the hyperplane must pass through in a rotation to vertical. We generalize hyperplane regression depth to k-flats for any k between 0 and d-1. The k=0 case gives the classical notion of center points. We prove that for any k and d, deep k-flats exist, that is, for any set of n points there always exists a k-flat with depth at least a constant fraction of n. As a consequence, we derive a linear-time (1+epsilon)-approximation algorithm for the deepest flat.
Bern Marshall
Eppstein David
No associations
LandOfFree
Multivariate Regression Depth 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 Multivariate Regression Depth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multivariate Regression Depth will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-44039