Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
415460 | Computational Geometry | 2013 | 8 Pages |
Abstract
A Monte Carlo approximation algorithm for the Tukey depth problem in high dimensions is introduced. The algorithm is a generalization of an algorithm presented by Rousseeuw and Struyf (1998) [20]. The performance of this algorithm is studied both analytically and experimentally.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dan Chen, Pat Morin, Uli Wagner,