|
Chapter Contents |
Previous |
Next |
| The KDE Procedure |
This method solves the fixed-point equation
![h = [ \frac{R(\varphi)}{nR(\hat{f}^{''}_{g(h)})
(\int x^2 \varphi(x) dx)^2} ] ^{1/5}](images/kdeeq51.gif)
PROC KDE solves this equation by first evaluating it on a grid of values spaced equally on a log scale. The largest two values from this grid that bound a solution are then used as starting values for a bisection algorithm.
The simple normal reference rule works by assuming
is
Gaussian in the preceding fixed-point equation. This results in
![h = {\hat \sigma} [4/(3n)]^{1/5}](images/kdeeq53.gif)
Silverman's rule of thumb (1986, §3.4.2) is computed as
![h = 0.9 \min [{\hat \sigma},(Q_{3}-Q_{1})/1.34] n^{-1/5}](images/kdeeq55.gif)
The oversmoothed bandwidth is computed as
![h = 3{\hat \sigma} [1/(70 \sqrt{\pi} n)]^{1/5}](images/kdeeq56.gif)
When you specify a WEIGHT variable, PROC KDE uses weighted versions
of Q3, Q1, and
in the preceding expressions. The
weighted quartiles are computed as weighted order statistics, and
the weighted variance takes the form

For the bivariate case, Wand and Jones (1993) note that automatic bandwidth selection is both difficult and computationally expensive. Their study of various ways of specifying a bandwidth matrix also shows that using two bandwidths, one in each coordinate's direction, is often adequate. PROC KDE enables you to adjust the two bandwidths by specifying a multiplier for the default bandwidths recommended by Bowman and Foster (1992):

You can specify the BWM= option to adjust the aforementioned bandwidths to provide the appropriate amount of smoothing for your application.
|
Chapter Contents |
Previous |
Next |
Top |
Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.