Exact computation of the halfspace depth
From MaRDI portal
Abstract: For computing the exact value of the halfspace depth of a point w.r.t. a data cloud of points in arbitrary dimension, a theoretical framework is suggested. Based on this framework a whole class of algorithms can be derived. In all of these algorithms the depth is calculated as the minimum over a finite number of depth values w.r.t. proper projections of the data cloud. Three variants of this class are studied in more detail. All of these algorithms are capable of dealing with data that are not in general position and even with data that contain ties. As is shown by simulations, all proposed algorithms prove to be very efficient.
Recommendations
- Computing halfspace depth and regression depth
- Computing halfspace depth contours based on the idea of a circular sequence
- Algorithm AS 307: Bivariate Location Depth
- Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm
- Approximate computation of projection depths
Cites work
- scientific article; zbMATH DE number 3842984 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- scientific article; zbMATH DE number 1873657 (Why is no real title available?)
- A Bivariate Sign Test
- A Quality Index Based on Data Depth and Multivariate Rank Tests
- Absolute approximation of Tukey depth: theory and experiments
- Algorithm AS 307: Bivariate Location Depth
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Computing depth contours of bivariate point clouds
- Computing halfspace depth and regression depth
- Computing multiple-output regression quantile regions
- Computing multiple-output regression quantile regions from projection quantiles
- Computing zonoid trimmed regions of dimension \(d>2\)
- Data depths satisfying the projection property
- Fast nonparametric classification based on data depth
- General notions of statistical depth function.
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- Multivariate dispersion, central regions and depth. The lift zonoid approach
- Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
- Multivariate risks and depth-trimmed regions
- On a notion of data depth based on random simplices
- On a notion of simplicial depth
- On approximate range counting and depth
- Projection-based depth functions and associated medians
- Quantile tomography: using quantiles with multivariate data
- Regression Depth
- Robustness and Complex Data Structures
- Stochastic linear programming with a distortion risk constraint
- The Tukey depth characterizes the atomic measure
- The densest hemisphere problem
- The random Tukey depth
- Zonoid trimming for multivariate distributions
Cited in
(46)- Computing halfspace depth contours based on the idea of a circular sequence
- Simple halfspace depth
- Barycentric cuts through a convex body
- On Exact Computation of Tukey Depth Central Regions
- Computing halfspace depth and regression depth
- Finite sample breakdown point of Tukey's halfspace median
- Fusing data depth with complex networks: community detection with prior information
- Another look at halfspace depth: flag halfspaces with applications
- Concentration of the empirical level sets of Tukey's halfspace depth
- Exact and approximate computation of the scatter halfspace depth
- A characterization of halfspace depth
- Reconstruction of atomic measures from their halfspace depth
- Symmetrisation of a class of two-sample tests by mutually considering depth ranks including functional spaces
- scientific article; zbMATH DE number 7800975 (Why is no real title available?)
- Multivariate and functional classification using depth and distance
- Uniform convergence rates for the approximated halfspace and projection depth
- Fast Computation of Tukey Trimmed Regions and Median in Dimension p > 2
- Some results on the computing of Tukey's halfspace median
- Depth-based classification for relational data with multiple attributes
- Approximate calculation of Tukey's depth and median with high-dimensional data
- Exact computation of bivariate projection depth and the Stahel-Donoho estimator
- Tukey depths and Hamilton-Jacobi differential equations
- Choosing among notions of multivariate depth statistics
- Integrated rank-weighted depth
- The limit of finite sample breakdown point of Tukey's halfspace median for general data
- Combining dependent tests based on data depth with applications to the two-sample problem for data of arbitrary types
- On the quality of randomized approximations of Tukey's depth
- Computational geometry and statistical depth measures
- Tukey’s Depth for Object Data
- Validity, consonant plausibility measures, and Conformal prediction
- Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm
- Regularized halfspace depth for functional data
- Computation of depth in \(C(X)\)
- Robust multivariate estimation based on statistical depth filters
- Computation of quantile sets for bivariate ordered data
- A new approach for the computation of halfspace depth in high dimensions
- Approximate computation of projection depths
- Halfspace depth
- Depth for curve data and applications
- Uniform convergence rates for halfspace depth
- Noncrossing structured additive multiple-output Bayesian quantile regression models
- Statistical depth meets machine learning: kernel mean embeddings and depth in functional data analysis
- Parallel computation of bivariate point data depths and display of intrinsic depth segments
- Nonparametric Imputation by Data Depth
- Exact computation of angular halfspace depth
- Centerpoints: a link between optimization and convex geometry
This page was built for publication: Exact computation of the halfspace depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1659242)
