Abstract
We investigate the extension of binning methodology to fast computation of several auxiliary quantities that arise in local polynomial smoothing. Examples include degrees of freedom measures, cross-validation functions, variance estimates, and exact measures of error. It is shown that the computational effort required for such approximations is of the same order of magnitude as that required for a binned local polynomial smooth.
Original language | English |
---|---|
Pages (from-to) | 337-350 |
Number of pages | 14 |
Journal | Journal of Computational and Graphical Statistics |
Volume | 5 |
Issue number | 4 |
DOIs | |
Publication status | Published - Dec 1996 |
Externally published | Yes |