arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.08498cs.LGstat.ML
收藏

基于Shapelet的时间序列分类的模式采样

Pattern Sampling for Shapelet-based Time Series Classification

Johannes Gutenberg University Mainz(美因茨约翰内斯·古腾堡大学)

Atif Raza, Stefan Kramer

摘要:

基于子序列的时间序列分类算法提供了准确和可解释的模型,但训练这些模型是非常计算密集型的。基于连续性的算法的渐近时间复杂度仍然是一个高阶多项式,因为这些算法是基于对高判别连续性的穷举搜索。模式采样是一种有效的解决模式爆炸问题的方法。因此,我们采用模式采样从离散时间序列数据中提取判别特征。基于离散化的时间序列数据创建加权trie树,以采样高度区分的模式。这些采样模式被用来识别形状,用于将时间序列分类问题转化为基于特征的分类问题。最后,可以使用任何现成的算法来训练分类模型。创建模式采样器需要少量的模式进行评估相比,以前的方法采用的穷举搜索。与以前提出的算法相比,我们的方法需要更少的计算和内存资源。实验证明了所提出的方法在分类精度和运行时性能方面的表现。

英文摘要:

Subsequence-based time series classification algorithms provide accurate and interpretable models, but training these models is extremely computation intensive. The asymptotic time complexity of subsequence-based algorithms remains a higher-order polynomial, because these algorithms are based on exhaustive search for highly discriminative subsequences. Pattern sampling has been proposed as an effective alternative to mitigate the pattern explosion phenomenon. Therefore, we employ pattern sampling to extract discriminative features from discretized time series data. A weighted trie is created based on the discretized time series data to sample highly discriminative patterns. These sampled patterns are used to identify the shapelets which are used to transform the time series classification problem into a feature-based classification problem. Finally, a classification model can be trained using any off-the-shelf algorithm. Creating a pattern sampler requires a small number of patterns to be evaluated compared to an exhaustive search as employed by previous approaches. Compared to previously proposed algorithms, our approach requires considerably less computational and memory resources. Experiments demonstrate how the proposed approach fares in terms of classification accuracy and runtime performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑