A randomized linear expected-time algorithm for computing the zonoid depth [R. Dyckerhoff, G. Koshevoy, K. Mosler, Zonoid data depth: Theory and computation, in: A. Prat (Ed.), COMPSTAT 1996 - Proceedings in Computational Statistics, Physica-Verlag, Heidelberg, 1996, pp. 235-240; K. Mosler, Multivariate Dispersion, Central Regions and Depth. The Lift Zonoid Approach, Lecture Notes in Statistics, vol. 165, Springer-Verlag, New York, 2002] of a point with respect to a fixed dimensional point set is presented.

Additional Metadata
Keywords Data depth, Robust statistics, Support vector machines, Zonoids, Zonotopes
Persistent URL dx.doi.org/10.1016/j.comgeo.2006.12.002
Journal Computational Geometry
Citation
Morin, P. (2008). An optimal randomized algorithm for d-variate zonoid depth. Computational Geometry, 39(3), 229–235. doi:10.1016/j.comgeo.2006.12.002