Reprint of: Approximating majority depth

DOI10.1016/J.COMGEO.2013.11.005MaRDI QIDQ906835zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3541764 (Why is no real title available?)
• scientific article; zbMATH DE number 1113915 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Quality Index Based on Data Depth and Multivariate Rank Tests
• An improved, simple construction of many halving edges
• Descriptive statistics for multivariate distributions
• Discrepancy and approximations for bounded VC-dimension
• Improved bounds for planar k-sets and related problems
• On a notion of data depth based on random simplices
• Optimal partition trees
• Point sets with many k -sets

This page was built for publication: Reprint of: Approximating majority depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906835)