Forward–backward algorithm

Hidden Markov model inference algorithm which computes the posterior marginals of all hidden state variables given a sequence of observations, making use of dynamic programming to make only 2 passes: one forward, one backward

The forward–backward algorithm is an inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions o 1 : T := o 1 , … , o T {\displaystyle o_{1:T}:=o_{1},\dots ,o_{T}} , i.e. it computes, for all hidden state variables X t ∈ { X 1 , … , X T } {\displaystyle X_{t}\in \{X_{1},\dots ,X_{T}\}} , the distribution P ( X t | o 1 : T ) {\displaystyle P(X_{t}\ |\ o_{1:T})} . This inference task is usually called smoothing.

Nº Q4909 ★

Comum · Saberes

Forward–backward algorithm

Hidden Markov model inference algorithm which computes the posterior marginals of all hidden state variables given a sequence of observations, making use of dynamic programming to make only 2 passes: one forward, one backward

Texto em inglês

The forward–backward algorithm is an inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions o 1 : T := o 1 , … , o T {\displaystyle o_{1:T}:=o_{1},\dots ,o_{T}} , i.e. it computes, for all hidden state variables X t ∈ { X 1 , … , X T } {\displaystyle X_{t}\in \{X_{1},\dots ,X_{T}\}} , the distribution P ( X t | o 1 : T ) {\displaystyle P(X_{t}\ |\ o_{1:T})} . This inference task is usually called smoothing.

Na Wikipédia

Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.

The forward–backward algorithm is an inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions o 1 : T := o 1 , … , o T {\displaystyle o_{1:T}:=o_{1},\dots ,o_{T}} , i.e. it computes, for all hidden state variables X t ∈ { X 1 , … , X T } {\displaystyle X_{t}\in \{X_{1},\dots ,X_{T}\}} , the distribution P ( X t | o 1 : T ) {\displaystyle P(X_{t}\ |\ o_{1:T})} . This inference task is usually called smoothing. The algorithm makes use of the principle of dynamic programming to efficiently compute the values that are required to obtain the posterior marginal distributions in two passes. The first pass goes forward in time while the second goes backward in time; hence the name forward–backward algorithm. The term forward–backward algorithm is also used to refer to any algorithm belonging to the general class of algorithms that operate on sequence models in a forward–backward manner. In this sense, the descriptions in the remainder of this article refer only to one specific instance of this class.

Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Enrique Benimeli (CC BY-SA 3.0) ·

Cartas próximas

Abrir

…

Confirmação