Absolute approximation of Tukey depth: Theory and experiments
Chen D, Morin P, Wagner U. 2012. Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications. 46(5), 566–573.
Download
No fulltext has been uploaded. References only!
Journal Article
| Published
Author
Chen, Dan;
Morin, Pat;
Wagner, UliISTA 
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) . The performance of this algorithm is studied both analytically and experimentally.
Publishing Year
Date Published
2012-07-01
Journal Title
Computational Geometry: Theory and Applications
Publisher
Elsevier
Volume
46
Issue
5
Page
566 - 573
IST-REx-ID
Cite this
Chen D, Morin P, Wagner U. Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications. 2012;46(5):566-573. doi:10.1016/j.comgeo.2012.03.001
Chen, D., Morin, P., & Wagner, U. (2012). Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2012.03.001
Chen, Dan, Pat Morin, and Uli Wagner. “Absolute Approximation of Tukey Depth: Theory and Experiments.” Computational Geometry: Theory and Applications. Elsevier, 2012. https://doi.org/10.1016/j.comgeo.2012.03.001.
D. Chen, P. Morin, and U. Wagner, “Absolute approximation of Tukey depth: Theory and experiments,” Computational Geometry: Theory and Applications, vol. 46, no. 5. Elsevier, pp. 566–573, 2012.
Chen D, Morin P, Wagner U. 2012. Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications. 46(5), 566–573.
Chen, Dan, et al. “Absolute Approximation of Tukey Depth: Theory and Experiments.” Computational Geometry: Theory and Applications, vol. 46, no. 5, Elsevier, 2012, pp. 566–73, doi:10.1016/j.comgeo.2012.03.001.
Google Scholar