Kernel density estimation
Encyclopedia
|
| Tutorials | Encyclopedia | Dictionary | Directory |
|
Kernel density estimation
Kernel density estimation of 100 normally distributed random numbers using different smoothing bandwidths. The Parzen window is also used in signal processing as a lag window, in such procedures as the Blackman-Tukey procedure. A histogram can be thought of as a collection of point samples from a kernel density estimate for which the kernel is a uniform box the width of the histogram bin.
DefinitionIf x1, x2, ..., xN ~ ƒ is an independent and identically-distributed random variables sample of a random variable, then the kernel density approximation of its probability density function is
where K is some kernel and h is the bandwidth (smoothing parameter). Quite often K is taken to be a standard Gaussian function with mean zero and variance 1:
IntuitionAlthough less smooth density estimators such as the histogram density estimator can be made to be asymptotically consistent, others are often either discontinuous or converge at slower rates than the kernel density estimator. Rather than grouping observations together in bins, the kernel density estimator can be thought to place small "bumps" at each observation, determined by the kernel function. The estimator consists of a "sum of bumps" and is clearly smoother as a result (see below image).
Six Gaussians (red) and their sum (blue). The Parzen window density estimate f(x) is obtained by dividing this sum by 6, the number of Gaussians. The variance of the Gaussians was set to 0.5. Note that where the points are denser the density estimate will have higher values. PropertiesLet \scriptstyle R(f,\hat f(x)) be the L2 risk function for ƒ. Under weak assumptions on ƒ and K,
By minimizing the theoretical risk function, it can be shown that the optimal bandwidth is
where
When the optimal choice of bandwidth is chosen, the risk function is \scriptstyle R(f, \hat f(x))\, \approx\, \tfrac{c_4}{n^{4/5}} for some constant c4 > 0. It can be shown that, under weak assumptions, there cannot exist a non-parametric estimator that converges at a faster rate than the kernel estimator. Note that the n−4/5 rate is slower than the typical n−1 convergence rate of parametric methods. Statistical implementation
See also
References
External links
de:Kerndichteschätzer fr:Estimateur_par_noyau ja:???????? Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article
|
|
top
©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement