arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.00732cs.LG
收藏

Extreme-SAX:基于极值点的时间序列分类符号表示

Extreme-SAX: Extreme Points Based Symbolic Representation for Time Series Classification

Coventry University(考文垂大学)

Muhammad Marwan Muhammad Fuad

摘要:

时间序列分类是数据采掘中的一个重要问题,在不同的领域有着广泛的应用。由于时间序列数据通常是高维的,降维技术已被提出作为一种有效的方法来降低其维数。时间序列数据最流行的降维技术之一是符号聚集近似(SAX),它受到文本挖掘和生物信息学算法的启发。SAX简单而高效,因为它使用预先计算的距离。SAX的缺点是它不能准确地表示时间序列中的重要点。在本文中,我们提出了Extreme-SAX(E-SAX),它只使用每个段的极值点来表示时间序列。E-SAX具有与原始SAX完全相同的简单性和效率,但它在时间序列分类方面比原始SAX提供了更好的结果,正如我们在各种时间序列数据集上进行的广泛实验所示。

英文摘要:

Time series classification is an important problem in data mining with several applications in different domains. Because time series data are usually high dimensional, dimensionality reduction techniques have been proposed as an efficient approach to lower their dimensionality. One of the most popular dimensionality reduction techniques of time series data is the Symbolic Aggregate Approximation (SAX), which is inspired by algorithms from text mining and bioinformatics. SAX is simple and efficient because it uses precomputed distances. The disadvantage of SAX is its inability to accurately represent important points in the time series. In this paper we present Extreme-SAX (E-SAX), which uses only the extreme points of each segment to represent the time series. E-SAX has exactly the same simplicity and efficiency of the original SAX, yet it gives better results in time series classification than the original SAX, as we show in extensive experiments on a variety of time series datasets.

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

↑