首页> 外文会议>ACM SIGKDD international conference on Knowledge discovery in data mining >Optimizing time series discretization for knowledge discovery
【24h】

Optimizing time series discretization for knowledge discovery

机译:为知识发现优化时间序列离散化

获取原文

摘要

Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal order of values. This often leads to symbols that do not correspond to states of the process generating the time series and cannot be interpreted meaningfully. We propose a new method for meaningful unsupervised discretization of numeric time series called Persist. The algorithm is based on the Kullback-Leibler divergence between the marginal and the self-transition probability distributions of the discretization symbols. Its performance is evaluated on both artificial and real life data in comparison to the most common discretization methods. Persist achieves significantly higher accuracy than existing static methods and is robust against noise. It also outperforms Hidden Markov Models for all but very simple cases.
机译:时间序列中的知识发现通常需要符号时间序列。将数字时间序列转换为符号时间序列的许多离散化方法会忽略值的时间顺序。这通常导致符号与生成时间序列的过程状态不对应,并且无法进行有意义的解释。我们为数字时间序列的有意义的无监督离散化提出了一种新的方法,称为Persist。该算法基于离散化符号的边际和自转移概率分布之间的Kullback-Leibler散度。与最常见的离散化方法相比,它在人工和现实数据上的性能都得到了评估。与现有的静态方法相比,Persist可以实现更高的精度,并且抗噪声能力强。除了非常简单的情况外,它还优于“隐马尔可夫模型”。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号