Reprint of: Approximating majority depth

DOI10.1016/j.comgeo.2013.11.005zbMath1386.65087OpenAlexW1965954846MaRDI QIDQ906835

Dan Chen, Pat Morin

Publication date: 29 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.11.005

zbMATH Keywords

data depthmajority depthmedian levelrange counting

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

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: Reprint of: Approximating majority depth