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

时间序列的早期分类基于费用的优化准则及算法

Early Classification of Time Series. Cost-based Optimization Criterion and Algorithms

Orange Labs(奥兰治实验室);AgroParisTech(巴黎高科农业学院);INRAe(法国国家农业、食品与环境研究院);Université Paris-Saclay(巴黎萨克雷大学)

Youssef Achenchabe, Alexis Bondu, Antoine Cornuéjols, Asma Dachraoui

摘要:

越来越多的应用需要尽可能快地识别输入时间序列的类别,而不会过度损害预测的准确性。在本文中,我们提出了一个新的优化准则,同时考虑到错误分类的成本和延迟的决策成本。基于这个优化标准,我们推导出一个家庭的非近视算法,试图预测预期的未来收益的信息与等待的成本平衡。在一类基于无监督的算法中,期望使用时间序列的聚类,而在第二类基于监督的算法中,时间序列根据用于标记它们的分类器的置信水平进行分组。在实际数据集上进行的大量实验表明,所提出的算法能够很好地解决早期性与准确性之间的权衡问题,基于监督的方法优于基于非监督的方法.此外,所有这些方法在各种条件下比基于近视策略的现有技术方法表现更好,该近视策略被认为是非常有竞争力的。

英文摘要:

An increasing number of applications require to recognize the class of an incoming time series as quickly as possible without unduly compromising the accuracy of the prediction. In this paper, we put forward a new optimization criterion which takes into account both the cost of misclassification and the cost of delaying the decision. Based on this optimization criterion, we derived a family of non-myopic algorithms which try to anticipate the expected future gain in information in balance with the cost of waiting. In one class of algorithms, unsupervised-based, the expectations use the clustering of time series, while in a second class, supervised-based, time series are grouped according to the confidence level of the classifier used to label them. Extensive experiments carried out on real data sets using a large range of delay cost functions show that the presented algorithms are able to satisfactorily solving the earliness vs. accuracy trade-off, with the supervised-based approaches faring better than the unsupervised-based ones. In addition, all these methods perform better in a wide variety of conditions than a state of the art method based on a myopic strategy which is recognized as very competitive.

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

↑