Complexity measures and features for times series classification

被引:12
作者
Baldan, Francisco J. [1 ]
Benitez, Jose M. [1 ]
机构
[1] Univ Granada, Andalusian Res Inst Data Sci & Computat Intellige, Dept Comp Sci & Artificial Intelligence, Digits Lab,iMUDS, Granada 18071, Spain
关键词
Classification; Complexity measures; Time series features; Interpretability; APPROXIMATE ENTROPY; TRANSFORM; PATTERNS; NETWORK;
D O I
10.1016/j.eswa.2022.119227
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Time series classification is a growing problem in different disciplines due to the progressive digitalization of the world. The best state-of-the-art algorithms focus on performance, seeking the best possible results, leaving interpretability at a second level, if any. Furthermore, interpretable proposals are far from providing competitive results. In this work, focused on time series classification, we propose a new representation of time series based on a robust and complete set of features. This new representation allows extracting more meaningful information on the underlying time series structure to develop effective classifiers whose results are much easier to interpret than current state-of-the-art models. The proposed feature set allows using the traditional vector-based classification algorithms in time series problems, significantly increasing the number of techniques available for this type of problem. To evaluate the performance of our proposal, we have used the state-of-the-art repository of time series classification, UCR, composed of 112 datasets. The experimental results show that through this representation, more interpretable classifiers can be obtained which are competitive. More specifically, they obtain no statistically significant differences from the second and third-best models of the state-of-the-art. Apart from competitive results in accuracy, our proposal is able to improve the model interpretability based on the set of features proposed.
引用
收藏
页数:17
相关论文
共 58 条
  • [1] Abdiansah A., 2015, INT J COMPUT APPL, V128, P28, DOI [10.5120/ijca2015906480, DOI 10.5120/IJCA2015906480]
  • [2] Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)
    Adadi, Amina
    Berrada, Mohammed
    [J]. IEEE ACCESS, 2018, 6 : 52138 - 52160
  • [3] Amigo JM, 2010, SPRINGER SER SYNERG, P1, DOI 10.1007/978-3-642-04084-9
  • [4] [Anonymous], 1997, An introduction to recursive partitioning using the rpart routines
  • [5] [Anonymous], 2012, P 2012 SIAM INT C DA
  • [6] Bagnall A, 2020, Arxiv, DOI arXiv:2004.06069
  • [7] The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances
    Bagnall, Anthony
    Lines, Jason
    Bostrom, Aaron
    Large, James
    Keogh, Eamonn
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2017, 31 (03) : 606 - 660
  • [8] A Run Length Transformation for Discriminating Between Auto Regressive Time Series
    Bagnall, Anthony
    Janacek, Gareth
    [J]. JOURNAL OF CLASSIFICATION, 2014, 31 (02) : 154 - 178
  • [9] Distributed FastShapelet Transform: a Big Data time series classification algorithm
    Baldan, Francisco J.
    Benitez, Jose M.
    [J]. INFORMATION SCIENCES, 2019, 496 : 451 - 463
  • [10] A Forecasting Methodology for Workload Forecasting in Cloud Systems
    Baldan, Francisco J.
    Ramirez-Gallego, Sergio
    Bergmeir, Christoph
    Herrera, Francisco
    Benitez, Jose M.
    [J]. IEEE TRANSACTIONS ON CLOUD COMPUTING, 2018, 6 (04) : 929 - 941