Join our mailing list
Get exclusive deals and learn about new products!
Reliable shipping
Flexible returns
This thoroughly revised and expanded new edition now includes a more detailed treatment of the EM algorithm, a description of an efficient approximate Viterbi-training procedure, a theoretical derivation of the perplexity measure and coverage of multi-pass decoding based on n-best search. Supporting the discussion of the theoretical foundations of Markov modeling, special emphasis is also placed on practical algorithmic solutions. Features: introduces the formal framework for Markov models; covers the robust handling of probability quantities; presents methods for the configuration of hidden Markov models for specific application areas; describes important methods for efficient processing of Markov models, and the adaptation of the models to different tasks; examines algorithms for searching within the complex solution spaces that result from the joint application of Markov chain and hidden Markov models; reviews key applications of Markov models.
Published by: Springer
Publication Date: 2014-01-28
Format: Hardcover
ISBN-13: 9781447163077
DOI: 10.1007/978-1-4471-6308-4
Dimensions: 235cm x155cm
Pages: 276