High-dimensional computation of the deepest location. (Q1583493)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | High-dimensional computation of the deepest location. |
scientific article |
Statements
High-dimensional computation of the deepest location. (English)
0 references
26 October 2000
0 references
The halfspace location depth of a point \(\theta\) relative to a data set \(X_{n}\) is defined as the smallest number of observations in any closed halfspace with boundary through \(\theta\). As such, halfspace depth can be seen as a kind of multivariate ranking. The deepest location, i.e., the \(\theta\) with maximal halfspace depth, is a multivariate generalization of the median. Until now the deepest location could only be computed for bivariate data. We construct an algorithm (called DEEPLOC) to approximate the deepest location in higher dimensions.
0 references
Algorithm
0 references
location depth
0 references
multivariate median
0 references
0 references
0 references
0 references