Data Depth and Maximum Feasible Subsystems

Komei Fukuda and Vera Rosta

Chapter Chapter 3 in Graph Theory and Combinatorial Optimization, 2005, pp 37-67 from Springer

Abstract: Abstract Various data depth measures were introduced in nonparametric statistics as multidimensional generalizations of ranks and of the median. A related problem in optimization is to find a maximum feasible subsystem, that is a solution satisfying as many constrainsts as possible, in a given system of linear inequalities. In this paper we give a unified framework for the main data depth measures such as the halfspace depth, the regression depth and the simplicial depth, and we survey the related results from nonparametric statistics, computational geometry, discrete geometry and linear optimization.

Keywords: Data Depth; Breakdown Point; Hyperplane Arrangement; Regression Depth; Simplicial Depth (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-25592-7_3

Ordering information: This item can be ordered from
http://www.springer.com/9780387255927

DOI: 10.1007/0-387-25592-3_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().