A local cross-validation algorithm
The usuall form of cross-validation is global in character, and is designed to estimate a density in some "average" sense over its entire support. In this paper we present a local version of squared-error cross-validation, suitable for estimating a probability density at a given point. It is shown theoretically to be asymptotically optimal in the sense of minimizing mean squared error. Numerical examples illustrate finite sample characteristic, and show that local cross-validation is a practical algorithm.
Volume (Year): 8 (1989)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:8:y:1989:i:2:p:109-117. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.