Cost-Aware Early Classification of Time Series
- 3.1k Downloads
In time series classification, two antagonist notions are at stake. On the one hand, in most cases, the sooner the time series is classified, the more rewarding. On the other hand, an early classification is more likely to be erroneous. Most of the early classification methods have been designed to take a decision as soon as sufficient level of reliability is reached. However, in many applications, delaying the decision with no guarantee that the reliability threshold will be met in the future can be costly. Recently, a framework dedicated to optimizing a trade-off between classification accuracy and the cost of delaying the decision was proposed, together with an algorithm that decides online the optimal time instant to classify an incoming time series. On top of this framework, we build in this paper two different early classification algorithms that optimize a trade-off between decision accuracy and the cost of delaying the decision. These algorithms are non-myopic in the sense that, even when classification is delayed, they can provide an estimate of when the optimal classification time is likely to occur. Our experiments on real datasets demonstrate that the proposed approaches are more robust than existing methods. The data and software related to this paper are available at https://github.com/rtavenar/CostAware_ECTS.
KeywordsTime-series classification Early classification
This work has been partly funded by ANR project ASTERIX (ANR-13-JS02- 0005-01) and CNES-TOSCA project VEGIDAR. Authors would like to thank Antoine Cornuéjols for his insight on the state-of-the-art, as well as data donors.
- 1.Antonucci, A., Scanagatta, M., Mauá, D.D., de Campos, C.P.: Early classification of time series by hidden markov models with set-valued parameters. In: Proceedings of the NIPS Time Series Workshop (2015)Google Scholar
- 3.Dachraoui, A., Bondu, A., Cornuéjols, A.: Early classification of time series as a non myopic sequential decision making problem. In: Appice, A., Rodrigues, P.P., Santos Costa, V., Soares, C., Gama, J., Jorge, A. (eds.) ECML PKDD 2015. LNCS (LNAI), vol. 9284, pp. 433–447. Springer, Heidelberg (2015). doi: 10.1007/978-3-319-23528-8_27 CrossRefGoogle Scholar
- 4.Ghalwash, M.F., Radosavljevic, V., Obradovic, Z.: Utilizing temporal patterns for estimating uncertainty in interpretable early decision making. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 402–411 (2014)Google Scholar
- 5.Hatami, N., Chira, C.: Classifiers with a reject option for early time-series classification. In: Proceedings of the IEEE Symposium on Computational Intelligence and Ensemble Learning (2013)Google Scholar
- 7.Ishiguro, K., Sawada, H., Sakano, H.: Multi-class boosting for early classification of sequences. In: Proceedings of the British Machine Vision Conference, pp. 24.1–24.10 (2010)Google Scholar
- 8.Keogh, E., Zhu, Q., Hu, B., Hao, Y., Xi, X., Wei, L., Ratanamahatana, C.A.: The UCR Time Series Classification/Clustering Homepage (2011). http://www.cs.ucr.edu/~eamonn/time_series_data/
- 9.Mori, U., Mendiburu, A., Dasgupta, S., Lozano, J.A.: Early classification of time series from a cost minimization point of view. In: Proceedings of the NIPS Time Series Workshop (2015)Google Scholar
- 11.Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825–2830 (2011)MathSciNetzbMATHGoogle Scholar
- 14.Xing, Z., Pei, J., Yu, P.S., Wang, K.: Extracting interpretable features for early classification on time series. In: Proceedings of the SIAM International Conference on Data Mining, pp. 247–258 (2011)Google Scholar