NobleBlocks

Research indexBook chapter

Hidden Markov Processes: Basic Properties

Vidyasagar

Princeton University Press eBooks24 Aug 2014

NobleIDark:/48914/w1/20260525/3EA76163DOI10.23943/princeton/9780691133157.003.0006

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

This chapter considers the basic properties of hidden Markov processes (HMPs) or hidden Markov models (HMMs), a special type of stochastic process. It begins with a discussion of three distinct types of HMMs and shows that they are all equivalent from the standpoint of their expressive power or modeling ability: Type 1 hidden Markov model, or a HMM of the deterministic function of a Markov chain type; hidden Markov model of Type 2, or a HMM of the random function of a Markov chain type; and hidden Markov model of Type 3, or a HMM of the joint Markov process type. The chapter also examines various issues related to the computation of likelihoods in a HMM before concluding with an overview of the Viterbi algorithm and the Baum–Welch algorithm.

Discussion

Topics

More

Suggest a correction or report