UTF8gbsn
The subject of today is the supervised learning of HMM
λ
=
(
A
,
B
,
π
)
\lambda=(A,B,\pi)
λ=(A,B,π). The task of the supervised learning of HMM is to
estimate
λ
=
(
A
,
B
,
π
)
\lambda=(A,B,\pi)
λ=(A,B,π) from these known observation sequences
O
O
O
and their corresponding state sequences
I
I
I.
Information
- ( O 1 , I 1 ) , ( O 2 , I 2 ) , ⋯ , ( O S , I S ) (O_1,I_1), (O_2,I_2), \cdots , (O_S,I_S) (O1,I1),(O2,I2),⋯,(OS,IS)
Quesiton: Estimating λ = ( A , B , π ) \lambda=(A,B,\pi) λ=(A,B,π)
-
Estimating transfer probability a i j a_{ij} aij:Let A i j A_{ij} Aij be the
frequence of time t t t with state i i i and t + 1 t+1 t+1 with state j j j, then
a i j a_{ij} aij is estimated by the following formula.
a ^ i j = A i j ∑ j = 1 N A i j \hat{a}_{ij}=\frac{A_{ij}}{\sum_{j=1}^{N}A_{ij}} a^ij=∑j=1NAijAij -
Estimating the observation probability b j ( k ) b_{j}(k) bj(k): Let B j k B_{jk} Bjk be
the state j j j with observation k k k, then b j ( k ) b_{j}(k) bj(k) is estimated by
the following formula.b ^ j ( k ) = B j k ∑ j = 1 N B j k \hat{b}_{j}(k)=\frac{B_{jk}}{\sum_{j=1}^{N}B_{jk}} b^j(k)=∑j=1NBjkBjk
-
Estimating the initial probability π i \pi_i πi: The estimation of
π i \pi_i πi is called π ^ i \hat{\pi}_i π^i. It comes from the frequence of
state q i q_i qi of the first state.