Regression depth and center points.

DOI10.1007/PL00009502MaRDI QIDQ1972305zbMATH OpenFDO

Authors David Eppstein, Nina Amenta, M. W. Bern, Shang-Hua Teng

Publication date 2000

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/9809037

zbMATH Keywords

robust statistics

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Robustness and adaptive procedures (parametric inference) (62F35) Linear regression; mixed models (62J05)

Abstract: We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least ceiling(n/(d+1)). as had been conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n hyperplanes in d dimensions there exists a point that cannot escape to infinity without crossing at least ceiling(n/(d+1)) hyperplanes. We also apply our approach to related questions on the existence of partitions of the data into subsets such that a common plane has nonzero regression depth in each subset, and to the computational complexity of regression depth problems.

Recommendations

• Multivariate regression depth
• Efficient algorithms for maximum regression depth
• Depth in an arrangement of hyperplanes
• On depth and deep points: A calculus.

Cited in

(22)

• The complexity of hyperplane depth in the plane
• The deepest regression method
• An improvement on the Rado bound for the centerline depth
• On depth and deep points: A calculus.
• Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence
• On the approximation of a membership function by empirical quantile functions
• Robust regression via mutivariate regression depth
• Median trajectories
• Algorithms for bivariate zonoid depth
• Computing the depth of a flat
• Points with large quadrant depth
• \(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
• Using Brouwer’s Fixed Point Theorem
• Network essence: PageRank completion and centrality-conforming Markov chains
• scientific article; zbMATH DE number 7306864 (Why is no real title available?)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Intersecting convex sets by rays
• Relative (p, )-approximations in geometry
• Discrete geometry. Abstracts from the workshop held January 21--26, 2024
• Combinatorial depth measures for hyperplane arrangements
• Efficient algorithms for maximum regression depth
• Centerpoints and Tverberg's technique

This page was built for publication: Regression depth and center points.

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