Complexity penalized support estimation |
| |
Authors: | Jussi Klemel |
| |
Institution: | Institut für Angewandte Mathematik, Universität Heidelberg, Im Neuenheimer Feld 294, 69120, Heidelberg, Germany |
| |
Abstract: | We consider the estimation of the support of a probability density function with iid observations. The estimator to be considered is a minimizer of a complexity penalized excess mass criterion. We present a fast algorithm for the construction of the estimator. The estimator is able to estimate supports which consists of disconnected regions. We will prove that the estimator achieves minimax rates of convergence up to a logarithmic factor simultaneously over a scale of Hölder smoothness classes for the boundary of the support. The proof assumes a sharp boundary for the support. |
| |
Keywords: | Adaptive estimation Data-dependent partitions Quality control Multivariate data Tree structured estimators |
本文献已被 ScienceDirect 等数据库收录! |