A new approach for the computation of halfspace depth in high dimensions
DOI10.1080/03610918.2017.1402040OpenAlexW2791251597MaRDI QIDQ5086196FDOQ5086196
Authors: Yijun Zuo 
Publication date: 1 July 2022
Published in: Communications in Statistics. Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2017.1402040
algorithmtime complexityhalfspace depthdefinition and computationhigh dimension and large sample size
Multivariate analysis (62H99) Applications of statistics (62P99) Nonparametric inference (62G99) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Algorithm AS 307: Bivariate Location Depth
- Robust Statistics
- The random Tukey depth
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- General notions of statistical depth function.
- Multivariate dispersion, central regions and depth. The lift zonoid approach
- On a notion of data depth based on random simplices
- Projection-based depth functions and associated medians
- Exact computation of the halfspace depth
- Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
- Title not available (Why is that?)
- A Quality Index Based on Data Depth and Multivariate Rank Tests
- Primal-dual methods for vertex and facet enumeration
- Computing depth contours of bivariate point clouds
- Structural properties and convergence results for contours of sample statistical depth functions.
- On depth and deep points: A calculus.
- Computing multiple-output regression quantile regions from projection quantiles
- Quantile tomography: using quantiles with multivariate data
- Title not available (Why is that?)
- Computing multiple-output regression quantile regions
- A Bivariate Sign Test
- Computing zonoid trimmed regions of dimension \(d>2\)
- Statistical challenges of high-dimensional data
- Title not available (Why is that?)
- High-dimensional computation of the deepest location.
- Convergence of quantile and depth regions
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing halfspace depth and regression depth
- Multidimensional trimming based on projection depth
- Exact computation of bivariate projection depth and the Stahel-Donoho estimator
- On approximate range counting and depth
- Absolute approximation of Tukey depth: theory and experiments
- Jensen's inequality for multivariate medians
- New results and new trends in computer science. Graz, Austria, June 20- 21, 1991. Proceedings
- On exact computation of some statistics based on projection pursuit in a general regression context
Cited In (12)
- Rigorous high-dimensional shadowing using containment: the general case
- Computation of projection regression depth and its induced median
- Depth distribution in high dimensions
- Estimating the probability that a given vector is in the convex hull of a random sample
- A characterization of halfspace depth
- A new characterization of Elfving's method for high dimensional computation
- Choosing among notions of multivariate depth statistics
- Least sum of squares of trimmed residuals regression
- Non-asymptotic analysis and inference for an outlyingness induced winsorized mean
- Tukey’s Depth for Object Data
- Flexible quantile contour estimation for multivariate functional data: beyond convexity
- High-dimensional computation of the deepest location.
Uses Software
This page was built for publication: A new approach for the computation of halfspace depth in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086196)
