Statistica Sinica

Peter J. Rousseeuw and Ida Ruts

Abstract:The halfplane location depth of a point relative to a bivariate data set X={x_{1},...,x_{n}} is the minimal number of observations in any closed halfplane that contains θ (Tukey (1975)). The halfplane median or Tukey median is the θ with maximal depthk(Donoho and Gasko (1992)). If this θ is not unique, the Tukey median is defined as the center of gravity of the set of points with depthk. In this paper we construct two algorithms for computing the Tukey median. The first one is relatively straightforward but quite slow, whereas the second (called HALFMED) is much faster. A small simulation study is performed, and some examples are given.

Key words and phrases:Algorithm, halfplane depth, robustness, Tukey depth.