We propose a low-storage, single-pass, sequential method for the execution of convex hull peeling for massive datasets. The method is shown to vastly reduce the computation time required for the existing convex hull peeling algorithm from O(n2) to O(n). Furthermore, the proposed method has significantly smaller storage requirements compared to the existing method. We present algorithms for low-storage, sequential computation of both the convex hull peeling multivariate median and the convex hull peeling pth depth contour, where 0 > p > 1. We demonstrate the accuracy and reduced computation time required of the proposed method by comparing to the existing convex hull peeling method through simulation studies.
|Original language||English (US)|
|Number of pages||11|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|State||Published - Jun 2007|
All Science Journal Classification (ASJC) codes
- Industrial and Manufacturing Engineering