Baum–Welch algorithm
Algorithm
In electrical engineering, statistical computing and bioinformatics, the Baum–Welch algorithm is a special case of the expectation–maximization algorithm used to find the unknown parameters of a hidden Markov model (HMM). It makes use of the forward-backward algorithm to compute the statistics for the expectation step.
Nº Q811478 ★
Common · Knowledge
Baum–Welch algorithm
Algorithm
In electrical engineering, statistical computing and bioinformatics, the Baum–Welch algorithm is a special case of the expectation–maximization algorithm used to find the unknown parameters of a hidden Markov model (HMM). It makes use of the forward-backward algorithm to compute the statistics for the expectation step.
From Wikipedia
In electrical engineering, statistical computing and bioinformatics, the Baum–Welch algorithm is a special case of the expectation–maximization algorithm used to find the unknown parameters of a hidden Markov model (HMM). It makes use of the forward-backward algorithm to compute the statistics for the expectation step. The Baum–Welch algorithm, the primary method for inference in hidden Markov models, is numerically unstable due to its recursive calculation of joint probabilities. As the number of variables grows, these joint probabilities become increasingly small, leading to the forward recursions rapidly approaching values below machine precision.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Hidden Markov model
Statistical Markov model
Nº Q176769 ★★★
Not listed
-
Expectation–maximization algorithm
Iterative method for finding maximum likelihood estimates in statistical models
Nº Q1275153 ★★
Not listed
-
M
Markov model
Probability tool
Nº Q6771326 ★
Not listed
-
C
Continuous mapping theorem
Probability theorem
Nº Q5165492 ★
Not listed
-
S
Stein's example
Phenomenon of joint estimation sometimes being strictly better than serial estimation across parameters
Nº Q3895097 ★
Not listed
-
P
Principle of maximum entropy
Principle in Bayesian statistics
Nº Q1417473 ★
Not listed