Fast implementation of the Tukey depth
From MaRDI portal
Publication:1695422
DOI10.1007/s00180-016-0697-8zbMath1417.65048arXiv1409.3901OpenAlexW2963557662MaRDI QIDQ1695422
Publication date: 7 February 2018
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.3901
Computational methods for problems pertaining to statistics (62-08) Estimation in multivariate analysis (62H12) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Robustness and adaptive procedures (parametric inference) (62F35)
Related Items (6)
Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm ⋮ Multiple-try simulated annealing algorithm for global optimization ⋮ A centrality notion for graphs based on Tukey depth ⋮ Integrated rank-weighted depth ⋮ Fast Computation of Tukey Trimmed Regions and Median in Dimension p > 2 ⋮ Computation of quantile sets for bivariate ordered data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing projection depth and its associated estimators
- Computing zonoid trimmed regions of dimension \(d>2\)
- Smooth depth contours characterize the underlying distribution
- The random Tukey depth
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Zonoid trimming for multivariate distributions
- Projection-based depth functions and associated medians
- General notions of statistical depth function.
- Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
- Algorithm AS 307: Bivariate Location Depth
- DD-Classifier: Nonparametric Classification Procedure Based onDD-Plot
- Applied Multivariate Statistical Analysis
- Computing Halfspace Depth and Regression Depth
This page was built for publication: Fast implementation of the Tukey depth
