论文标题
何时将事件分类为“开放时间”系列?
When to Classify Events in Open Times Series?
论文作者
论文摘要
在许多应用程序中,例如,在预测性维护中,有一个压力,可以提前预测事件,并没有过多地延迟决策。这转化为对决策的初级和准确性之间的权衡,这是有限长度和独特标签的时间序列研究的主题。这导致了对时间序列(ECTS)早期分类(ECT)的强大算法。本文首次研究了当不同阶级的事件以流媒体方式发生,没有预定义的结尾时,这一论文进行了权衡。在开放时间序列问题(ECOTS)的早期分类中,任务是预测事件,即它们的班级和时间间隔,这是在优化准确性与早期权衡的那一刻。有趣的是,我们发现可以将ECTS算法以原则上的方式明智地适应这个新问题。我们通过为Ecots方案转换两种最先进的ECT算法来说明我们的方法。在这种新方法打开的各种应用中,我们开发了一种预测性维护用例,可优化警报触发时间,从而证明了这种新方法的功能。
In numerous applications, for instance in predictive maintenance, there is a pression to predict events ahead of time with as much accuracy as possible while not delaying the decision unduly. This translates in the optimization of a trade-off between earliness and accuracy of the decisions, that has been the subject of research for time series of finite length and with a unique label. And this has led to powerful algorithms for Early Classification of Time Series (ECTS). This paper, for the first time, investigates such a trade-off when events of different classes occur in a streaming fashion, with no predefined end. In the Early Classification in Open Time Series problem (ECOTS), the task is to predict events, i.e. their class and time interval, at the moment that optimizes the accuracy vs. earliness trade-off. Interestingly, we find that ECTS algorithms can be sensibly adapted in a principled way to this new problem. We illustrate our methodology by transforming two state-of-the-art ECTS algorithms for the ECOTS scenario. Among the wide variety of applications that this new approach opens up, we develop a predictive maintenance use case that optimizes alarm triggering times, thus demonstrating the power of this new approach.