隐马尔科夫模型HMM,这回理解了

很好的讲解:http://www.hankcs.com/ml/hidden-markov-model.html

以前一直迷惑,这回理解了

java 源码:

https://github.com/anusreeb/mahout-1/tree/master/mrlegacy/src/main/java/org/apache/mahout/classifier/sequencelearning/hmm

python源码:

https://github.com/hmmlearn/hmmlearn

补充些代码有助于理解:

alpha:

屏幕快照 2016-08-05 上午11.43.07.png

屏幕快照 2016-08-05 上午11.44.45.png

def _forward(states, observations, A, B, Pi):
    num_states = len(states)
    num_observ = len(observations)
    alpha = np.zeros((num_observ, num_states))
    for i in range(num_states):
        alpha[0, i] = Pi[i] * B[i, observations[0]]
    for t in range(1, num_observ):
        for i in range(num_states):
            sum = 0.0
            for j in range(num_states):
                sum += alpha[t - 1, j] * A[j, i]
            alpha[t, i] = sum * B[i, observations[t]]
    return alpha

 beta: 

屏幕快照 2016-08-05 下午2.21.46.png

屏幕快照 2016-08-05 下午2.22.44.png

def _backward(states, observations, A, B):
    num_states = len(states)
    num_observ = len(observations)
    beta = np.zeros((num_observ, num_states))
    for i in range(num_states):
        beta[num_observ - 1][i] = 1
 
    for t in range(num_observ - 2, 0):
        for i in range(num_states):
            sum = 0.0
            for j in range(num_states):
                sum += beta[t + 1][j] * A[i][j] * B[j][observations[t + 1]]
            beta[t][i] = sum
 
    return beta

HMM应用讲解:http://www2.coe.pku.edu.cn/tpic/2012121843059445.pdf

HMM实践:https://www.jianshu.com/p/942d1beb7fdd

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值