pith. sign in

arxiv: cs/9809037 · v2 · submitted 1998-09-21 · 💻 cs.CG · math.CO

Regression Depth and Center Points

classification 💻 cs.CG math.CO
keywords depthregressionceilingdimensionsexistshyperplanesleastpoints
0
0 comments X
read the original abstract

We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least ceiling(n/(d+1)). as had been conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n hyperplanes in d dimensions there exists a point that cannot escape to infinity without crossing at least ceiling(n/(d+1)) hyperplanes. We also apply our approach to related questions on the existence of partitions of the data into subsets such that a common plane has nonzero regression depth in each subset, and to the computational complexity of regression depth problems.

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.