Hidden Markov model
A hidden Markov model is a probabilistic sequence model in which latent states form a Markov process and generate observable data according to state-dependent probabilities.
Machine Learning Algorithms in Depth
A hidden Markov model is a probabilistic model with latent discrete states that form a Markov chain and generate observed data through state-dependent emission distributions.
- How it is used
- Models time-series data when observed values arise from a latent discrete-state Markov chain.
- How deep it goes
- Derives recursive forward inference and adds a backward pass, then provides pseudo-code and implementation scaffolding.
- Examples
- Uses sleep–wake modeling and applications including stock prediction, DNA sequencing, handwriting recognition, and speech recognition.
- What you can do after
- Evaluate latent-state marginals with forward recursion or forward–backward inference.
Read how Machine Learning Algorithms in Depth explains hidden Markov model →
Timeless Algorithms, The Foundational Ideas
A hidden Markov model is a probabilistic model of sequences in which hidden states evolve according to transition probabilities and generate observable outputs.
- How it is used
- Models sequential data with unobserved states and estimates parameters that explain observed sequences.
- How deep it goes
- Explains hidden-variable estimation through Baum–Welch and EM, but gives no implementation or step-by-step derivation.
- Examples
- Names speech recognition, natural language processing, biological sequence analysis, and financial modeling as application areas.
- What you can do after
- Understand how hidden variables complicate likelihood estimation and how Baum–Welch iteratively increases observed-data likelihood.
Read how Timeless Algorithms, The Foundational Ideas explains hidden Markov model →
Related concepts
- emission matrixuses · An emission matrix contains the probabilities of observed symbols conditional on each latent state in a hidden Markov model.
- Markov chainuses · A Markov chain is a stochastic process of states whose transition probabilities depend on the current state rather than the full preceding history.
- forward-backward algorithmused by · The forward-backward algorithm combines forward and backward recursions to compute latent-state marginal probabilities using observations from an entire sequence.
- maximum likelihood estimationuses · Maximum likelihood estimation is a statistical method that selects parameter values maximizing the likelihood of observed data under a specified probabilistic model.
- expectation maximizationused by · Expectation maximization is an iterative algorithm for estimating model parameters with latent or unobserved variables by alternating latent-variable estimation with parameter optimization.
Questions about hidden Markov model
What is hidden Markov model?
A hidden Markov model is a probabilistic sequence model in which latent states form a Markov process and generate observable data according to state-dependent probabilities.
Which Manning books explain hidden Markov model?
Machine Learning Algorithms in Depth and Timeless Algorithms, The Foundational Ideas.
What is hidden Markov model a kind of?
Hidden Markov model is a kind of model. A model is an abstract representation of a system, phenomenon, application, or domain that captures relevant structure, behavior, data, or beliefs.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

