arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.01628cs.LGcs.AIstat.ML
收藏

早期时间序列分类算法的实证比较

Early Time-Series Classification Algorithms: An Empirical Comparison

Institute of Informatics and Telecommunications, NCSR ‘Demokritos’(“德谟克利特”国家科学研究中心信息与电信研究所)

Charilaos Akasiadis, Evgenios Kladis, Evangelos Michelioudakis, Elias Alevizos, Alexander Artikis

摘要:

早期时间序列分类(ETSC)是通过观察尽可能少的测量来预测输入时间序列的类别的任务。这种方法可以用于在许多时间关键的应用中获得分类预测。然而,可用的技术并不同样适用于每个问题,因为数据特征的差异可能会影响算法在早期性,准确性,F1分数和训练时间方面的性能。我们评估了现有的六个ETSC算法的公开数据,以及两个新引入的数据集来自生命科学和海洋领域。我们的目标是提供一个框架,ETSC算法的评估和比较,并获得直觉,这些方法如何在现实生活中的应用程序。所提出的框架也可以作为新的相关技术的基准。

英文摘要:

Early Time-Series Classification (ETSC) is the task of predicting the class of incoming time-series by observing as few measurements as possible. Such methods can be employed to obtain classification forecasts in many time-critical applications. However, available techniques are not equally suitable for every problem, since differentiations in the data characteristics can impact algorithm performance in terms of earliness, accuracy, F1-score, and training time. We evaluate six existing ETSC algorithms on publicly available data, as well as on two newly introduced datasets originating from the life sciences and maritime domains. Our goal is to provide a framework for the evaluation and comparison of ETSC algorithms and to obtain intuition on how such approaches perform on real-life applications. The presented framework may also serve as a benchmark for new related techniques.

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

↑