1 citations · 1 across the 11 of their papers we have counts for
4 papers · 1 filter
Comparing Machine Learning Algorithms by Union-Free Generic Depth
Hannah Blocher, Georg Schollmeyer, Malte Nalenz +1
We propose a framework for descriptively analyzing sets of partial orders based on the concept of depth functions. Despite intensive studies in linear and metric spaces, there is v…
Robust Statistical Comparison of Random Variables with Locally Varying Scale of Measurement
Christoph Jansen, Georg Schollmeyer, Hannah Blocher +2
Spaces with locally varying scale of measurement, like multidimensional structures with differently scaled dimensions, are pretty common in statistics and machine learning. Neverth…
A note on the connectedness property of union-free generic sets of partial orders
Georg Schollmeyer, Hannah Blocher
This short note describes and proves a connectedness property which was introduced in Blocher et al. [2023] in the context of data depth functions for partial orders. The connected…
Depth Functions for Partial Orders with a Descriptive Analysis of Machine Learning Algorithms
Hannah Blocher, Georg Schollmeyer, Christoph Jansen +1
We propose a framework for descriptively analyzing sets of partial orders based on the concept of depth functions. Despite intensive studies of depth functions in linear and metric…