We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least [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 [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
The minimum number of misclassifications achievable with afine hyperplanes on a given set of labeled...
In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ po...
A finite point set in ?^d is in general position if no d + 1 points lie on a common hyperplane. Let ...
We show that, for any set of n points in d dimensions, there exists a hyperplane with regression dep...
Regression depth, introduced by Rousseeuw and Hubert in 1999, is a notion that measures how good of ...
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyp...
A collection of n hyperplanes in R d forms a hyperplane arrangement. The depth of a point ` 2 R d...
The location depth (Tukey 1975) of a point relative to a p-dimensional data set Z of size n is defi...
Given a set S = , the depth #(Q) of a point Q is the minimum number of points of S that ...
International audienceGiven a set P of n points in the plane, the Oja depth of a point x is defined ...
Given a set <em>P</em> of points in the plane we are interested in points that are `deep' in the set...
AbstractDeepest regression (DR) is a method for linear regression introduced by P. J. Rousseeuw and ...
AbstractWe present an algorithm for locating a query point q in an arrangement of n hyperplanes in R...
AbstractLet S be a family of n points in Ed. The exact fitting problem is that of finding a hyperpla...
Every notion of depth induces a stratification of the plane in regions of points with the same depth...
The minimum number of misclassifications achievable with afine hyperplanes on a given set of labeled...
In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ po...
A finite point set in ?^d is in general position if no d + 1 points lie on a common hyperplane. Let ...
We show that, for any set of n points in d dimensions, there exists a hyperplane with regression dep...
Regression depth, introduced by Rousseeuw and Hubert in 1999, is a notion that measures how good of ...
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyp...
A collection of n hyperplanes in R d forms a hyperplane arrangement. The depth of a point ` 2 R d...
The location depth (Tukey 1975) of a point relative to a p-dimensional data set Z of size n is defi...
Given a set S = , the depth #(Q) of a point Q is the minimum number of points of S that ...
International audienceGiven a set P of n points in the plane, the Oja depth of a point x is defined ...
Given a set <em>P</em> of points in the plane we are interested in points that are `deep' in the set...
AbstractDeepest regression (DR) is a method for linear regression introduced by P. J. Rousseeuw and ...
AbstractWe present an algorithm for locating a query point q in an arrangement of n hyperplanes in R...
AbstractLet S be a family of n points in Ed. The exact fitting problem is that of finding a hyperpla...
Every notion of depth induces a stratification of the plane in regions of points with the same depth...
The minimum number of misclassifications achievable with afine hyperplanes on a given set of labeled...
In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ po...
A finite point set in ?^d is in general position if no d + 1 points lie on a common hyperplane. Let ...