All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $90.88Trending at AU $93.26
- AU $28.71Trending at AU $30.90
- AU $52.98Trending at AU $79.02
- AU $26.88Trending at AU $29.42
- AU $16.99Trending at AU $22.22
- AU $36.48Trending at AU $41.31
- AU $30.98Trending at AU $33.19
About this product
- DescriptionThis thoroughly revised and expanded new edition w 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.
- Author BiographyProf. Dr.-Ing. Gernot A. Fink is Head of the Pattern Recognition Research Group at TU Dortmund University, Dortmund, Germany. His other publications include the Springer title Markov Models for Handwriting Recognition.
- Author(s)Gernot A. Fink
- PublisherSpringer London Ltd
- Date of Publication15/01/2014
- SubjectComputing: Professional & Programming
- Series TitleAdvances in Computer Vision and Pattern Recognition
- Place of PublicationEngland
- Country of PublicationUnited Kingdom
- ImprintSpringer London Ltd
- Content Noteblack & white illustrations
- Weight602 g
- Width156 mm
- Height234 mm
- Spine17 mm
- Format DetailsLaminated cover
- Edition Statement2nd Revised edition
This item doesn't belong on this page.
Thanks, we'll look into this.