Skip to main navigation Skip to search Skip to main content

Exact computation of the halfspace depth

  • Germany; University of Cologne

Research output: Contribution to journal › Article › peer-review

56 Citations (Scopus)

Abstract

For computing the exact value of the halfspace depth of a point w.r.t. a data cloud of n 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.

Original languageEnglish
Pages (from-to)19-30
Number of pages12
JournalComputational Statistics and Data Analysis
Volume98
DOIs
Publication statusPublished - 1 Jun 2016
Externally publishedYes

Keywords

  • Combinatorial algorithm
  • Exact algorithm
  • Orthogonal complement
  • Projection
  • Tukey depth

Fingerprint

Dive into the research topics of 'Exact computation of the halfspace depth'. Together they form a unique fingerprint.

Cite this