Full-text links:

Download:

Current browse context:

cs

References & Citations

Bookmark

(what is this?)
CiteULike logo Connotea logo BibSonomy logo del.icio.us logo Digg logo Reddit logo

Computer Science > Computational Geometry

Title: Regression Depth and Center Points

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.
Comments: 14 pages, 3 figures
Subjects: Computational Geometry (cs.CG); Combinatorics (math.CO)
ACM classes: G.3
Journal reference: Discrete Comput. Geom. 23(3):305-323, 2000
Cite as: arXiv:cs/9809037v2 [cs.CG]

Submission history

From: David Eppstein [view email]
[v1] Mon, 21 Sep 1998 21:55:49 GMT (31kb)
[v2] Mon, 26 Jul 1999 22:00:37 GMT (116kb)