Exact and approximate computation of the scatter halfspace depth

08/10/2022
by   Xiaohui Liu, et al.
0

The scatter halfspace depth (sHD) is an extension of the location halfspace (also called Tukey) depth that is applicable in the nonparametric analysis of scatter. Using sHD, it is possible to define minimax optimal robust scatter estimators for multivariate data. The problem of exact computation of sHD for data of dimension d ≥ 2 has, however, not been addressed in the literature. We develop an exact algorithm for the computation of sHD in any dimension d and implement it efficiently using C++ for d ≤ 5, and in R for any dimension d ≥ 1. Since the exact computation of sHD is slow especially for higher dimensions, we also propose two fast approximate algorithms. All our programs are freely available in the R package scatterdepth.

READ FULL TEXT
research
08/09/2022

On exact computation of Tukey depth central regions

The Tukey (or halfspace) depth extends nonparametric methods toward mult...
research
09/11/2023

On the quality of randomized approximations of Tukey's depth

Tukey's depth (or halfspace depth) is a widely used measure of centralit...
research
05/04/2020

Exact computation of projection regression depth and fast computation of its induced median and other estimators

Zuo (2019) (Z19) addressed the computation of the projection regression ...
research
07/15/2020

Approximate computation of projection depths

Data depth is a concept in multivariate statistics that measures the cen...
research
04/04/2020

Choosing among notions of multivariate depth statistics

Classical multivariate statistics measures the outlyingness of a point b...
research
07/13/2020

Approximate Vertex Enumeration

The problem to compute a V-polytope which is close to a given H-polytope...
research
08/14/2016

Depth and depth-based classification with R-package ddalpha

Following the seminal idea of Tukey, data depth is a function that measu...

Please sign up or login with your details

Forgot password? Click here to reset