Skip to main content
  • 1707 Accesses

Abstract

When applying HMMs in practice one — as always in the field of statistical pattern recognition — is faced with the problem to robustly estimate the parameters on the available training samples. Yet the situation is not as severe as in the case of n-gram models, for which no useful models could be created without suitable measures (cf. section 6.5). However, also with HMMs one is confronted with the so-called sparse data problem when working with more complex model architectures. Then chances are high, that the model parameters can either no longer be computed due to numerical reasons, or that an overfitting of the model to the sample data considered occurs. This can in extreme cases lead to the situation that the models estimated have learned the sample set “by heart”, i.e. they describe nothing but known samples. Such a behavior can, however, be diagnosed by an accompanying evaluation on an independent cross-validation set and the training procedure can then be stopped at a suitable position.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Robust Parameter Estimation. In: Markov Models for Pattern Recognition. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71770-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71770-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71766-9

  • Online ISBN: 978-3-540-71770-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics