Weighted lens depth: Some applications to supervised classification
Resumen:
Starting with Tukey’s pioneering work in the 1970’s, the notion of depth in statistics has been widely extended especially in the last decade. These extensions include high dimensional data, functional data, and manifold-valued data. In particular, in the learning paradigm, the depth-depth method has become a useful technique. In this paper we extend the notion of lens depth to the case of data in metric spaces, and prove its main properties, with particular emphasis on the case of Riemannian manifolds, where we extend the concept of lens depth in such a way that it takes into account non-convex structures on the data distribution. Next we illustrate our results with some simulation results and also in some interesting real datasets, including pattern recognition in phylogenetic trees using the depth–depth approach.
| 2020 | |
| ANII: FCE_1_2019_1_156054 | |
| Mathematics - Statistics theory | |
| Inglés | |
| Universidad de la República | |
| COLIBRI | |
| https://hdl.handle.net/20.500.12008/37377 | |
| Acceso abierto | |
| Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
