-
SPS
IEEE Members: Free
Non-members: FreeLength: 0:55:59
The evidence function and its relation to Occam's razor rule are introduced and discussed. The Laplacian approximation of probability density functions is presented. The trade-off between complexity and accuracy is discussed in the context of Bayesian learning.