Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A Stahel-Donoho estimator based on huberized outlyingness
Computational Statistics & Data Analysis
Simulated annealing for higher dimensional projection depth
Computational Statistics & Data Analysis
Exactly computing bivariate projection depth contours and median
Computational Statistics & Data Analysis
Computing projection depth and its associated estimators
Statistics and Computing
Hi-index | 0.03 |
The idea of data depth provides a new and promising methodology for multivariate nonparametric analysis. Nevertheless, the computation of data depth and the depth function has remained as a very challenging problem which has hindered the methodology from becoming more prevailing in practice. The same is true for the powerful Stahel-Donoho (S-D) estimator. Here, we present an exact algorithm for the computation of the bivariate projection depth (PD) of data points and consequently of the S-D estimator.