Lower bounds for computing statistical depth.

DOI10.1016/S0167-9473(02)00032-4MaRDI QIDQ1608898zbMATH OpenOpenAlexFDO

Authors Greg Aloupis, Carmen Cortés, Francisco Gómez, Michael Soss, Godfried Toussaint

Publication date 13 August 2002

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-9473(02)00032-4

zbMATH Keywords

Simplicial depthHalfspace depthSign tests

Mathematics Subject Classification ID

Multivariate analysis (62H99)

Recommendations

• Algorithm AS 307: Bivariate Location Depth
• A lower bound for computing Oja depth
• On Combinatorial Depth Measures
• Computing a high depth point in the plane
• Ray-shooting depth: computing statistical data depth of point sets in the plane

Cites work

• scientific article; zbMATH DE number 3541764 (Why is no real title available?)
• scientific article; zbMATH DE number 1445286 (Why is no real title available?)
• A Bivariate Sign Test
• A Quality Index Based on Data Depth and Multivariate Rank Tests
• Algorithm AS 307: Bivariate Location Depth
• Bivariate Sign Tests
• Fast implementation of depth contours using topological sweep
• General notions of statistical depth function.
• Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
• On a notion of data depth based on random simplices
• Ordering directional data: Concepts of data depth on circles and spheres
• Regression Depth
• The depth function of a population distribution.

Cited in

(18)

• k-hull depth: in between simplicial and halfspace depth
• General notions of statistical depth function.
• K-sign depth: from asymptotics to efficient implementation
• Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
• Fitting a step function to a point set with outliers based on simplicial thickness data structures
• Optimal algorithms for geometric centers and depth
• Point set stratification and Delaunay depth
• A lower bound for computing Oja depth
• On Liu's simplicial depth and Randles' interdirections
• Computing the depth distribution of a set of boxes
• Extending the centerpoint theorem to multiple points
• Finding simplices containing the origin in two and three dimensions
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
• Penalty-based aggregation of multidimensional data
• On Combinatorial Depth Measures
• Halfspace depth
• Ray-shooting depth: computing statistical data depth of point sets in the plane

Describes a project that uses

Uses Software

• AS 307

This page was built for publication: Lower bounds for computing statistical depth.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608898)