Bump hunting through density curvature features

arXiv:2208.00174v3 Announce Type: replace-cross
Abstract: Bump hunting deals with finding in sample spaces meaningful data subsets known as bumps. These have traditionally been conceived as modal or concave regions in the graph of the underlying density function. We define an abstract bump construct based on curvature functionals of the probability density. Then, we explore several alternative characterizations involving derivatives up to second order. In particular, a suitable implementation of Good and Gaskins' original concave bumps is proposed in the multivariate …

abstract arxiv construct data deals explore features function graph hunting math.st modal probability sample spaces stat.me stat.ml stat.th subsets the graph through type