...
首页> 外文期刊>OASIcs : OpenAccess Series in Informatics >Incremental HMM with an improved Baum-Welch Algorithm
【24h】

Incremental HMM with an improved Baum-Welch Algorithm

机译:改进的Baum-Welch算法实现增量式HMM

获取原文

摘要

There is an increasing demand for systems which handle higher density, additional loads as seen in storage workload modelling, where workloads can be characterized on-line. This paper aims to find a workload model which processes incoming data and then updates its parameters "on-the-fly." Essentially, this will be an incremental hidden Markov model (IncHMM) with an improved Baum-Welch algorithm. Thus, the benefit will be obtaining a parsimonious model which updates its encoded information whenever more real time workload data becomes available. To achieve this model, two new approximations of the Baum-Welch algorithm are defined, followed by training our model using discrete time series. This time series is transformed from a large network trace made up of I/O commands, into a partitioned binned trace, and then filtered through a K-means clustering algorithm to obtain an observation trace. The IncHMM, together with the observation trace, produces the required parameters to form a discrete Markov arrival process (MAP). Finally, we generate our own data trace (using the IncHMM parameters and a random distribution) and statistically compare it to the raw I/O trace, thus validating our model.
机译:从存储工作负载建模可以看出,可以在线表征工作负载的系统对处理更高密度和额外负载的系统的需求不断增长。本文旨在找到一种工作负载模型,该模型可以处理传入的数据,然后“即时”更新其参数。本质上,这将是具有改进的Baum-Welch算法的增量式隐马尔可夫模型(IncHMM)。因此,好处将是获得一个简化模型,只要有更多实时工作负载数据可用,该模型就会更新其编码信息。为了实现该模型,定义了Baum-Welch算法的两个新近似值,然后使用离散时间序列训练我们的模型。该时间序列从由I / O命令组成的大型网络跟踪转换为分区的合并跟踪,然后通过K-means聚类算法进行过滤以获得观察跟踪。 IncHMM与观察轨迹一起产生所需的参数,以形成离散的马尔可夫到达过程(MAP)。最后,我们生成自己的数据跟踪(使用IncHMM参数和随机分布),并将其与原始I / O跟踪进行统计比较,从而验证我们的模型。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号