20 citations · 53 across the 5 of their papers we have counts for
Showing math.STShow all
2 papers · 1 filter
math.ST2019★ 14 cited
Uniform convergence rates for the approximated halfspace and projection depth
Stanislav Nagy, Rainer Dyckerhoff, Pavlo Mozharovskyi
The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of h…
math.ST2016★ 15 cited
Convergence of depths and depth-trimmed regions
Rainer Dyckerhoff
Depth is a concept that measures the `centrality' of a point in a given data cloud or in a given probability distribution. Every depth defines a family of so-called trimmed regions…