High-dimensional computation of the deepest location.
The halfspace location depth of a point \(\theta\) relative to a data set \(X_{n}\) is defined as the smallest number of observations in any closed halfspace with boundary through \(\theta\). As such, halfspace depth can be seen as a kind of multivariate ranking. The deepest location, i.e., the \(\theta\) with maximal halfspace depth, is a multivariate generalization of the median. Until now the deepest location could only be computed for bivariate data. We construct an algorithm (called DEEPLOC) to approximate the deepest location in higher dimensions.
- A Quality Index Based on Data Depth and Multivariate Rank Tests
- Algorithm AS 307: Bivariate Location Depth
- Asymptotic distributions of the maximal depth estimators for regression and multivariate location
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Computing depth contours of bivariate point clouds
- Control Charts for Multivariate Processes
- Descriptive statistics for multivariate distributions
- scientific article; zbMATH DE number 3978165 (Why is no real title available?)
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- scientific article; zbMATH DE number 1203741 (Why is no real title available?)
- scientific article; zbMATH DE number 509167 (Why is no real title available?)
- scientific article; zbMATH DE number 1086063 (Why is no real title available?)
- scientific article; zbMATH DE number 1113915 (Why is no real title available?)
- scientific article; zbMATH DE number 1424313 (Why is no real title available?)
- scientific article; zbMATH DE number 1446704 (Why is no real title available?)
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- Notions of Limiting P Values Based on Data Depth and Bootstrap
- On a notion of data depth based on random simplices
- Regression Depth
- Projection-based depth functions and associated medians
- The deepest point for distributions in infinite dimensional spaces
- On min-max majority and deepest points
- Some results on the computing of Tukey's halfspace median
- Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm
- Finite sample breakdown point of Tukey's halfspace median
- Depth distribution in high dimensions
- Multivariate and functional classification using depth and distance
- An algorithm for the multivariate Tukey median
- Depth-based classification method underlain by a remote concentration measure for processing asymmetric data
- Location–Scale Depth
- Multivariate functional outlier detection
- Approximate calculation of Tukey's depth and median with high-dimensional data
- A new approach for the computation of halfspace depth in high dimensions
- Distance‐Based Tests for Homogeneity of Multivariate Dispersions
- Halfspace depth
- Efficient algorithms for maximum regression depth
- Inferences based on multiple skipped correlations
This page was built for publication: High-dimensional computation of the deepest location.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583493)
