English
Related papers

Related papers: Fast and exact implementation of 3-dimensional Tuk…

200 papers

The Tukey (or halfspace) depth extends nonparametric methods toward multivariate data. The multivariate analogues of the quantiles are the central regions of the Tukey depth, defined as sets of points in the $d$-dimensional space whose…

Computation · Statistics 2024-09-30 Vít Fojtík , Petra Laketa , Pavlo Mozharovskyi , Stanislav Nagy

Tukey depth function is one of the most famous multivariate tools serving robust purposes. It is also very well known for its computability problems in dimensions $p \ge 3$. In this paper, we address this computing issue by presenting two…

Computation · Statistics 2016-10-07 Xiaohui Liu

Given data in $\mathbb{R}^{p}$, a Tukey $\kappa$-trimmed region is the set of all points that have at least Tukey depth $\kappa$ w.r.t. the data. As they are visual, affine equivariant and robust, Tukey regions are useful tools in…

Computation · Statistics 2018-11-09 Xiaohui Liu , Karl Mosler , Pavlo Mozharovskyi

We present a new fast approximate algorithm for Tukey (halfspace) depth level sets and its implementation-ABCDepth. Given a $d$-dimensional data set for any $d\geq 1$, the algorithm is based on a representation of level sets as…

Data Structures and Algorithms · Computer Science 2018-12-11 Milica Bogićević , Milan Merkle

We present a new algorithm for Tukey (halfspace) depth level sets and its implementation. Given $d$-dimensional data set for any $d\geq 2$, the algorithm is based on representation of level sets as intersections of balls in $R^d$, and can…

Computational Geometry · Computer Science 2016-11-16 Milica Bogicevic , Milan Merkle

Tukey's depth offers a powerful tool for nonparametric inference and estimation, but also encounters serious computational and methodological difficulties in modern statistical data analysis. This paper studies how to generalize and compute…

Methodology · Statistics 2023-05-04 Yiyuan She , Shao Tang , Jingze Liu

Tukey's depth (or halfspace depth) is a widely used measure of centrality for multivariate data. However, exact computation of Tukey's depth is known to be a hard problem in high dimensions. As a remedy, randomized approximations of Tukey's…

Machine Learning · Statistics 2025-07-08 Simon Briend , Gábor Lugosi , Roberto Imbuzeiro Oliveira

Mean estimation is a fundamental task in statistics and a focus within differentially private statistical estimation. While univariate methods based on the Gaussian mechanism are widely used in practice, more advanced techniques such as the…

Machine Learning · Computer Science 2025-02-27 Gavin Brown , Lydia Zakynthinou

The concept of depth represents methods to measure how deep an arbitrary point is positioned in a dataset and can be seen as the opposite of outlyingness. It has proved very useful and a wide range of methods have been developed based on…

Methodology · Statistics 2020-01-09 Hugo Lewi Hammer , Anis Yazidi , Håvard Rue

Determining the representativeness of a point within a data cloud has recently become a desirable task in multivariate analysis. The concept of statistical depth function, which reflects centrality of an arbitrary point, appears to be…

Computation · Statistics 2016-03-02 Pavlo Mozharovskyi

The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires the consideration of all possible one-dimensional projections. In this paper we propose a random depth…

Computation · Statistics 2007-07-03 J. A. Cuesta-Albertos , A. Nieto-Reyes

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…

Computation · Statistics 2022-08-11 Xiaohui Liu , Yuzi Liu , Petra Laketa , Stanislav Nagy , Yuting Chen

We develop a novel exploratory tool for non-Euclidean object data based on data depth, extending the celebrated Tukey's depth for Euclidean data. The proposed metric halfspace depth, applicable to data objects in a general metric space,…

Methodology · Statistics 2021-09-02 Xiongtao Dai , Sara Lopez-Pintado

The Tukey depth of a flat with respect to a point set is a concept that appears in many areas of discrete and computational geometry. In particular, the study of centerpoints, center transversals, Ham Sandwich cuts, or $k$-edges can all be…

Computational Geometry · Computer Science 2021-03-17 Daniel Bertschinger , Jonas Passweg , Patrick Schnider

We give the first dimensionality reduction methods for the overconstrained Tukey regression problem. The Tukey loss function $\|y\|_M = \sum_i M(y_i)$ has $M(y_i) \approx |y_i|^p$ for residual errors $y_i$ smaller than a prescribed…

Data Structures and Algorithms · Computer Science 2019-05-15 Kenneth L. Clarkson , Ruosong Wang , David P. Woodruff

Data depth is a concept in multivariate statistics that measures the centrality of a point in a given data cloud in $\IR^d$. If the depth of a point can be represented as the minimum of the depths with respect to all one-dimensional…

Computation · Statistics 2020-07-17 Rainer Dyckerhoff , Pavlo Mozharovskyi , Stanislav Nagy

The $DD\alpha$-classifier, a nonparametric fast and very robust procedure, is described and applied to fifty classification problems regarding a broad spectrum of real-world data. The procedure first transforms the data from their original…

Applications · Statistics 2022-11-10 Pavlo Mozharovskyi , Karl Mosler , Tatjana Lange

For multivariate data, Tukey's half-space depth is one of the most popular depth functions available in the literature. It is conceptually simple and satisfies several desirable properties of depth functions. The Tukey median, the…

Statistics Theory · Mathematics 2012-01-06 Subhajit Dutta , Anil K. Ghosh , Probal Chaudhuri

Halfspace (or Tukey) depth is a fundamental and robust measure of centrality of data points in multivariate datasets. Computing the depth of a point with respect to the uniform distribution on an open convex body in $\mathbb{R}^d$ is a…

Computational Geometry · Computer Science 2025-07-17 Purvi Gupta , Anant Narayanan

We give the first differentially private algorithms that estimate a variety of geometric features of points in the Euclidean space, such as diameter, width, volume of convex hull, min-bounding box, min-enclosing ball etc. Our work relies…

Data Structures and Algorithms · Computer Science 2025-12-29 Yue Gao , Or Sheffet
‹ Prev 1 2 3 10 Next ›