menu
{ "item_title" : "Markov Models for Pattern Recognition", "item_author" : [" Gernot A. Fink "], "item_description" : "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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/44/717/133/1447171330_b.jpg", "price_data" : { "retail_price" : "64.99", "online_price" : "64.99", "our_price" : "64.99", "club_price" : "64.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Markov Models for Pattern Recognition|Gernot A. Fink

Markov Models for Pattern Recognition : From Theory to Applications

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781447171331
  • ISBN-10: 1447171330
  • Publisher: Springer
  • Publish Date: August 2016
  • Dimensions: 9.21 x 6.14 x 0.61 inches
  • Shipping Weight: 0.91 pounds
  • Page Count: 276

Related Categories

You May Also Like...

    1

BAM Customer Reviews