Algorithms for bivariate zonoid depth
| Autor: | Pat Morin, Harish Gopala |
|---|---|
| Jazyk: | angličtina |
| Předmět: |
Discrete mathematics
Control and Optimization Efficient algorithm Computation 0102 computer and information sciences Bivariate analysis 01 natural sciences Computer Science Applications 010104 statistics & probability Computational Mathematics Computational Theory and Mathematics 010201 computation theory & mathematics Depth map Depth contour Zonoids Computational statistics Zonotopes Point (geometry) Geometry and Topology 0101 mathematics Computational problem Algorithm Mathematics Statistical data depth |
| Zdroj: | Computational Geometry. (1):2-13 |
| ISSN: | 0925-7721 |
| DOI: | 10.1016/j.comgeo.2007.05.007 |
| Popis: | Zonoid depth is a definition of data depth proposed by Dyckerhoff et al. [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, August 1996, pp. 235–240]. Efficient algorithms for solving several computational problems related to zonoid depth in 2-dimensional (bivariate) data sets are studied. These include algorithms for computing a zonoid depth map, computing a zonoid depth contour, and computing the zonoid depth of a point. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|