Half-space mass: a maximally robust and efficient data depth method
From MaRDI portal
Publication:747292
DOI10.1007/s10994-015-5524-xzbMath1341.68150OpenAlexW1065912679MaRDI QIDQ747292
Takashi Washio, Kai Ming Ting, Bo Chen, Gholamreza Haffari
Publication date: 23 October 2015
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-015-5524-x
Nonparametric robustness (62G35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (2)
Affine invariant integrated rank-weighted statistical depth: properties and finite sample analysis ⋮ Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms
Uses Software
Cites Work
- Unnamed Item
- Computational science and its applications -- ICCSA 2011. International conference, Santander, Spain, June 20--23, 2011. Proceedings, Part III
- Local depth
- Some intriguing properties of Tukey's half-space depth
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- General notions of statistical depth function.
- Mass estimation
- The infrared structure of gauge theory amplitudes in the high-energy limit
This page was built for publication: Half-space mass: a maximally robust and efficient data depth method