Mathematics > Statistics Theory
[Submitted on 27 Nov 2014]
Title:A fully data-driven method for estimating density level sets
View PDFAbstract:Density level sets can be estimated using plug-in methods, excess mass algorithms or a hybrid of the two previous methodologies. The plug-in algorithms are based on replacing the unknown density by some nonparametric estimator, usually the kernel. Thus, the bandwidth selection is a fundamental problem from an applied perspective. However, if some a priori information about the geometry of the level set is available, then excess mass algorithms could be useful. Hybrid methods such that granulometric smoothing algorithm assume a mild geometric restriction on the level set and it requires a pilot nonparametric estimator of the density. In this work, a new hybrid algorithm is proposed under the assumption that the level set is r-convex. The main problem in practice is that r is an unknown geometric characteristic of the set. A stochastic algorithm is proposed for selecting its optimal value. The resulting data-driven reconstruction of the level set is able to achieve the same convergence rates as the granulometric smoothing method. However, they do no depend on any penalty term because, although the value of the shape index r is a priori unknown, it is estimated in a data-driven way from the sample points. The practical performance of the estimator proposed is illustrated through a real data example.
Submission history
From: Paula Saavedra-Nieves [view email][v1] Thu, 27 Nov 2014 19:32:25 UTC (380 KB)
Current browse context:
math.ST
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.