There are many problems that can be modeled using both Markov chain and Hidden Markov model (HMM). Can anyone please explain mathematically, why HMM should be preferred over Markov chain? Also, please mention any available reference (book, publications). Thank you.
2026-02-23 10:07:20.1771841240
Advantage of using Hidden Markov Model over Markov Chain
284 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MARKOV-CHAINS
- Calculating probabilities using Markov chains.
- Probability being in the same state
- Random walk on $\mathbb{Z}^2$
- Polya's Urn and Conditional Independence
- Markov Chain never reaches a state
- Finding a mixture of 1st and 0'th order Markov models that is closest to an empirical distribution
- Find probability function of random walk, stochastic processes
- Generating cycles on a strongly connected graph
- Will be this random walk a Markov chain?
- An irreducible Markov chain cannot have an absorbing state
Related Questions in HIDDEN-MARKOV-MODELS
- HMM with hidden outcomes, knapsack problem
- Transition Kernel and Transition matrix
- Can someone help me with this problem on Markov Chain?
- Markov switching model joint distribution
- What is the significance of "removal_effects" in ChannelAttribution R package?
- Picking path at random in DAG graph with probability equals to path weight.
- Finding a recursive formula for these probabilities in a semi-Markov chain
- Probability of observation sequence not knowing previous observations
- Name of this Markov model, and how to estimate?
- Continous Observation with HMM & Gaussian
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Here is just one example where the process could be modeled using both methods, but the HMM should be preferred here because it will explain the data better and will give better predictive results.
Suppose that we have a hidden Markov process $X_1, X_2, \dots$ with each $X_{t} \in \{A, B\}$. Let $$\mathbb{P}(X_{t + 1} = A \mid X_{t} = A) = 0.9 = \mathbb{P}(X_{t + 1} = B \mid X_{t} = B).$$ So the hidden process is very "sticky" and is likely to stay in the same state with each transition.
Suppose that $Y_1, Y_2, \dots$ is the observed random process, with each $Y_t \in \{0, 1\}$ and $$\mathbb{P}(Y_t = 0 \mid X_t = A) = 0.8 = \mathbb{P}(Y_t = 1 \mid X_t = B).$$ If you model $Y_1, Y_2, \dots$ as a simple Markov chain with a transition probability matrix that doesn't change over time, then you would estimate transition probabilities $$\mathbb{P}(Y_{t + 1} = 0 \mid Y_t = 0) \approx 0.645 \approx \mathbb{P}(Y_{t + 1} = 1 \mid Y_t = 1).$$ Suppose you have just seen the following sequence: $$001001000.$$ If you use the true distribution, the HMM, to model the data then you can infer that the current hidden state $X_t$ is very likely to be $A$. Then your estimate of $\mathbb{P}(Y_{t + 1} = 0 \mid Y_t = 0, Y_{t - 1} = 0, \dots)$ will be the true value, $0.74$, because $$\mathbb{P}(Y_{t + 1} = 0 \mid X_t = A) = \mathbb{P}(Y_{t + 1} = 0 \mid X_t = A, X_{t + 1} = A)\mathbb{P}(X_{t + 1} = A \mid X_t = A) + \mathbb{P}(Y_{t + 1} = 0 \mid X_t = A, X_{t + 1} = B)\mathbb{P}(X_{t + 1} = B \mid X_t = A) = 0.8\cdot0.9 + 0.2\cdot0.1 = 0.74.$$ However, if you use the simple Markov chain model you will not be making use of the information from the recent sequence of mostly $0$s, and you will underestimate the probability that the next observation will be $0$. You will estimate $\mathbb{P}(Y_{t + 1} = 0 \mid Y_t = 0, Y_{t - 1} = 0, \dots) = \mathbb{P}(Y_{t + 1} = 0 \mid Y_{t} = 0)$ to be $0.645$, less than the true value.