返回
An efficient forward-backward algorithm for an explicit-duration hidden Markov model
DOI:10.1109/LSP.2002.806705.png)
摘要
En 中文
Existing algorithms for estimating the model parameters of an explicit-duration hidden Markov model (HMM) usually require computations as large as O((MD2 + M-2)T) or O(M-2 DT), where M is the number of states; D is the maximum possible interval between state transitions; and T is the period of observations used to estimate the model parameters. Because of such computational requirements, these algorithms are not practical when we wish to construct an HMM model with large state space and large explicit state duration and process a large amount of measurement data to obtain high accuracy. We propose a new forward-backward algorithm whose computational complexity is only O ((MD + M-2) T), a reduction by almost a factor of D when D > M and whose memory requirement is O(MT). As an application example, we discuss an HMM characterization of access traffic observed at a large-scale Web site: we formulate the Web access pattern in terms of an HMM with explicit duration and estimate the model parameters using our algorithm.
Keyword:
explicit-duration HMM
hidden Markov model (HMM)
hidden semi-Markov model
traffic characterization
variable-duration HMM
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
引用论文
A TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION关于语音识别中的隐马尔可夫模型和选定应用的教程
PROCEEDINGS OF THE IEEE
IF25.9
Connecting Digitalization and Sustainability: Proptech in the Real Estate Operations and Management连接数字化和可持续发展: 房地产运营和管理中的Proptech
没有更多内容

