Abstract
Let l=f^n(x) be the kernel estimate of a density f(x) from a sample of size n. Wahba [6] has developed an upper bound to E[f(x)-l=f^n(x)]2. In the present paper, we find the kernel function of finite support [m=-T, T] that minimizes Wahba's upper bound. It is Q(y) = (1 + am=-1) (2T)m=-1 [1-m=-a|y|a] where a = 2-pm=-1, p m=ge 1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Pattern Analysis and Machine Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.