Minimum local distance density estimation
From MaRDI portal
Abstract: We present a local density estimator based on first order statistics. To estimate the density at a point, , the original sample is divided into subsets and the average minimum sample distance to over all such subsets is used to define the density estimate at . The tuning parameter is thus the number of subsets instead of the typical bandwidth of kernel or histogram-based density estimators. The proposed method is similar to nearest-neighbor density estimators but it provides smoother estimates. We derive the asymptotic distribution of this minimum sample distance statistic to study globally optimal values for the number and size of the subsets. Simulations are used to illustrate and compare the convergence properties of the estimator. The results show that the method provides good estimates of a wide variety of densities without changes of the tuning parameter, and that it offers competitive convergence performance.
Recommendations
Cites work
- All of Nonparametric Statistics
- An optimal \(k\)-nearest neighbor for density estimation
- Asymptotic theory of statistics and probability
- Choice of neighbor order in nearest-neighbor classification
- Kernel density estimation for heavy-tailed distributions using the champernowne transformation
- Kernel density estimation via diffusion
- On Estimation of a Probability Density Function and Mode
- On optimal and data-based histograms
- On the histogram as a density estimator:L 2 theory
- Optimization of k nearest neighbor density estimates
This page was built for publication: Minimum local distance density estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980049)