Robust regression and outlier detection
Robust regression and outlier detection
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Computing depth contours of bivariate point clouds
Computational Statistics & Data Analysis - Special issue on classification
Computing zonoid trimmed regions of dimension d2
Computational Statistics & Data Analysis
Exact computation of bivariate projection depth and the Stahel-Donoho estimator
Computational Statistics & Data Analysis
On directional multiple-output quantile regression
Journal of Multivariate Analysis
Robust classification for skewed data
Advances in Data Analysis and Classification
Computing multiple-output regression quantile regions
Computational Statistics & Data Analysis
Computing multiple-output regression quantile regions from projection quantiles
Computational Statistics
Hi-index | 0.00 |
To facilitate the application of projection depth, an exact algorithm is proposed from the view of cutting a convex polytope with hyperplanes. Based on this algorithm, one can obtain a finite number of optimal direction vectors, which are x-free and therefore enable us (Liu et al., Preprint, 2011) to compute the projection depth and most of its associated estimators of dimension p驴2, including Stahel-Donoho location and scatter estimators, projection trimmed mean, projection depth contours and median, etc. Both real and simulated examples are also provided to illustrate the performance of the proposed algorithm.