The expected convex hull trimmed regions of a sample

Authors:
Ignacio Cascos
Affiliations:
Department of Statistics, Universidad Carlos III de Madrid, Leganés (Madrid), Spain 28911
Venue:
Computational Statistics
Year:
2007

Citing 0
Cited 5

Computing zonoid trimmed regions of dimension d2

Computational Statistics & Data Analysis
Weighted-mean trimming of multivariate data

Journal of Multivariate Analysis
Trimmed regions induced by parameters of a probability

Journal of Multivariate Analysis
Exactly computing bivariate projection depth contours and median

Computational Statistics & Data Analysis
The Depth Problem: Identifying the Most Representative Units in a Data Group

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a data set in the multivariate Euclidean space, we study regions of central points built by averaging all their subsets with a fixed number of elements. The averaging of these sets is performed by appropriately scaling the Minkowski or elementwise summation of their convex hulls. The volume of such central regions is proposed as a multivariate scatter estimate and a circular sequence algorithm to compute the central regions of a bivariate data set is described.