Computing halfspace depth contours based on the idea of a circular sequence
DOI10.1007/S11424-015-3160-YzbMATH Open1382.68267OpenAlexW2235767226MaRDI QIDQ256759FDOQ256759
Authors: Haiping Ren, Guofu Wang, Xiao Hui Liu 
Publication date: 10 March 2016
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-015-3160-y
Recommendations
Directional data; spatial statistics (62H11) Applications of mathematical programming (90C90) Sensitivity, stability, parametric optimization (90C31) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Algorithm AS 307: Bivariate Location Depth
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Finite sample breakdown points of projection based multivariate location and scatter statistics
- Title not available (Why is that?)
- Zonoid trimming for multivariate distributions
- General notions of statistical depth function.
- Regression Depth
- On Maximum Depth and Related Classifiers
- On a notion of data depth based on random simplices
- Projection-based depth functions and associated medians
- A nonparametric multivariate multisample test based on data depth
- Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primal-dual methods for vertex and facet enumeration
- Computing depth contours of bivariate point clouds
- Exactly computing bivariate projection depth contours and median
- Computing multiple-output regression quantile regions from projection quantiles
- Quantile tomography: using quantiles with multivariate data
- Computing zonoid trimmed regions of bivariate data sets
- Title not available (Why is that?)
- Computing multiple-output regression quantile regions
- The quickhull algorithm for convex hulls
- On directional multiple-output quantile regression
- Computing zonoid trimmed regions of dimension \(d>2\)
- The expected convex hull trimmed regions of a sample
Cited In (5)
- Computing halfspace depth and regression depth
- A three-stage approach for segmenting degraded color images: smoothing, lifting and thresholding (SLaT)
- Exact computation of the halfspace depth
- Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm
- Continuity of halfspace depth contours and maximum depth estimators: Diagnostics of depth-related methods
Uses Software
This page was built for publication: Computing halfspace depth contours based on the idea of a circular sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256759)
