Approximating majority depth
From MaRDI portal
Publication:364853
DOI10.1016/j.comgeo.2013.06.005zbMath1273.65033arXiv1205.1524OpenAlexW1974889018MaRDI QIDQ364853
Publication date: 3 September 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1524
Monte Carlo methods (65C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal partition trees
- On a notion of data depth based on random simplices
- Descriptive statistics for multivariate distributions
- Discrepancy and approximations for bounded VC-dimension
- Improved bounds for planar \(k\)-sets and related problems
- A Quality Index Based on Data Depth and Multivariate Rank Tests
- Point sets with many k -sets
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Approximating majority depth