首页> 外文期刊>Journal of classification >A Run Length Transformation for Discriminating Between Auto Regressive Time Series
【24h】

A Run Length Transformation for Discriminating Between Auto Regressive Time Series

机译:游程长度转换以区分自动回归时间序列

获取原文
获取原文并翻译 | 示例
           

摘要

We describe a simple time series transformation to detect differences in series that can be accurately modelled as stationary autoregressive (AR) processes. The transformation involves forming the histogram of above and below the mean run lengths. The run length (RL) transformation has the benefits of being very fast, compact and updatable for new data in constant time. Furthermore, it can be generated directly from data that has already been highly compressed. We first establish the theoretical asymptotic relationship between run length distributions and AR models through consideration of the zero crossing probability and the distribution of runs. We benchmark our transformation against two alternatives: the truncated Autocorrelation function (ACF) transform and the AR transformation, which involves the standard method of fitting the partial autocorrelation coefficients with the Durbin-Levinson recursions and using the Akaike Information Criterion stopping procedure. Whilst optimal in the idealized scenario, representing the data in these ways is time consuming and the representation cannot be updated online for new data. We show that for classification problems the accuracy obtained through using the run length distribution tends towards that obtained from using the full fitted models. We then propose three alternative distance measures for run length distributions based on Gower's general similarity coefficient, the likelihood ratio and dynamic time warping (DTW). Through simulated classification experiments we show that a nearest neighbour distance based on DTWconverges to the optimal faster than classifiers based on Euclidean distance, Gower's coefficient and the likelihood ratio. We experiment with a variety of classifiers and demonstrate that although the RL transform requires more data than the best performing classifier to achieve the same accuracy as AR or ACF, this factor is at worst non-increasing with the series length, m, whereas the relative time taken to fit AR and ACF increases with m. We conclude that if the data is stationary and can be suitably modelled by an AR series, and if time is an important factor in reaching a discriminatory decision, then the run length distribution transform is a simple and effective transformation to use.
机译:我们描述了一种简单的时间序列变换,以检测可以精确建模为平稳自回归(AR)过程的序列差异。转换涉及形成平均游程长度以上和以下的直方图。游程长度(RL)转换的优点是可以在恒定时间内非常快,紧凑且可更新新数据。此外,它可以直接从已经高度压缩的数据中生成。首先,通过考虑过零概率和行程分布,建立行程长度分布与AR模型之间的理论渐近关系。我们以两种选择作为基准来对变换进行基准测试:截尾自相关函数(ACF)变换和AR变换,这涉及用Durbin-Levinson递归拟合部分自相关系数并使用Akaike信息准则停止程序的标准方法。尽管在理想情况下是最佳选择,但以这些方式表示数据非常耗时,并且无法在线更新新数据的表示方式。我们表明,对于分类问题,通过使用游程长度分布获得的准确性趋向于通过使用完全拟合模型获得的准确性。然后,我们根据高尔的一般相似系数,似然比和动态时间扭曲(DTW),为行程长度分布提出了三种替代距离度量。通过模拟分类实验,我们表明,基于DTW的最近邻距离比基于欧氏距离,高尔系数和似然比的分类器收敛到最优更快。我们对各种分类器进行了实验,结果表明,尽管与最佳性能的分类器相比,RL变换需要更多的数据才能达到与AR或ACF相同的准确性,但该因子在最坏的情况下不会随着序列长度m的增加而增加。适应AR和ACF所需的时间随着m的增加而增加。我们得出的结论是,如果数据是固定的并且可以通过AR系列进行适当建模,并且如果时间是做出歧视性决策的重要因素,那么游程长度分布变换就是一种使用简单有效的变换。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号