We see in (2.53) that the kernel-bandwidth parameter
can strongly affect the PDF
estimate
, especially when the number of observations
is finite. Very small
values
will produce an irregular spiky
, while very large values will excessively smooth out the
structure of
. For the case of finite data, i.e., finite
, the best possible strategy is to
aim at a compromise between these two effects. Indeed, in this case, finding optimal values of
entails additional constrains or strategies. For instance, the ML estimate yields an optimal
value, and this is what we do in practice.
The case of an infinite number of observations, i.e.,
, is theoretically very
interesting. In this case, Parzen proved that it is possible to have the PDF estimate converge to
the actual PDF [125,48]. Let us consider
to be the estimator of the PDF at a
point
derived from a random sample of size
. This estimator has a mean
and
variance
. The estimator
converges in mean square to the true
value
, i.e.,
| (56) |
| (57) |
![]() |