Benchmarking Multivariate Time Series Classification Algorithms

• URL: http://arxiv.org/abs/2007.13156v2
• Date: Wed, 26 Apr 2023 08:49:30 GMT
• Title: Benchmarking Multivariate Time Series Classification Algorithms
• Authors: Alejandro Pasos Ruiz, Michael Flynn and Anthony Bagnall
• Abstract summary: Time Series Classification (TSC) involved building predictive models for a discrete target variable from ordered, real valued, attributes. Over recent years, a new set of TSC algorithms have been developed which have made significant improvement over the previous state of the art. We review recently proposed bespoke MTSC algorithms based on deep learning, shapelets and bag of words approaches.
• Score: 69.12151492736524
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Time Series Classification (TSC) involved building predictive models for a discrete target variable from ordered, real valued, attributes. Over recent years, a new set of TSC algorithms have been developed which have made significant improvement over the previous state of the art. The main focus has been on univariate TSC, i.e. the problem where each case has a single series and a class label. In reality, it is more common to encounter multivariate TSC (MTSC) problems where multiple series are associated with a single label. Despite this, much less consideration has been given to MTSC than the univariate case. The UEA archive of 30 MTSC problems released in 2018 has made comparison of algorithms easier. We review recently proposed bespoke MTSC algorithms based on deep learning, shapelets and bag of words approaches. The simplest approach to MTSC is to ensemble univariate classifiers over the multivariate dimensions. We compare the bespoke algorithms to these dimension independent approaches on the 26 of the 30 MTSC archive problems where the data are all of equal length. We demonstrate that the independent ensemble of HIVE-COTE classifiers is the most accurate, but that, unlike with univariate classification, dynamic time warping is still competitive at MTSC.

Related papers

• DCID: Deep Canonical Information Decomposition [84.59396326810085]
  We consider the problem of identifying the signal shared between two one-dimensional target variables. We propose ICM, an evaluation metric which can be used in the presence of ground-truth labels. We also propose Deep Canonical Information Decomposition (DCID) - a simple, yet effective approach for learning the shared variables.
  arXiv  Detail & Related papers  (2023-06-27T16:59:06Z)
• Convolutional and Deep Learning based techniques for Time Series Ordinal Classification [7.047582157120573]
  Time Series Ordinal Classification (TSOC) is the field covering this gap, yet unexplored in the literature. This paper presents a first benchmarking of TSOC methodologies, exploiting the ordering of the target labels to boost the performance of current TSC state-of-the-art.
  arXiv  Detail & Related papers  (2023-06-16T11:57:11Z)
• FormerTime: Hierarchical Multi-Scale Representations for Multivariate Time Series Classification [53.55504611255664]
  FormerTime is a hierarchical representation model for improving the classification capacity for the multivariate time series classification task. It exhibits three aspects of merits: (1) learning hierarchical multi-scale representations from time series data, (2) inheriting the strength of both transformers and convolutional networks, and (3) tacking the efficiency challenges incurred by the self-attention mechanism.
  arXiv  Detail & Related papers  (2023-02-20T07:46:14Z)
• Enhancing Multivariate Time Series Classifiers through Self-Attention and Relative Positioning Infusion [4.18804572788063]
  Time Series Classification (TSC) is an important and challenging task for many visual computing applications. We propose two novel attention blocks that can enhance deep learning-based TSC approaches. We show that adding the proposed attention blocks improves base models' average accuracy by up to 3.6%.
  arXiv  Detail & Related papers  (2023-02-13T20:50:34Z)
• The FreshPRINCE: A Simple Transformation Based Pipeline Time Series Classifier [0.0]
  We look at whether the complexity of the algorithms considered state of the art is really necessary. Many times the first approach suggested is a simple pipeline of summary statistics or other time series feature extraction approaches. We test these approaches on the UCR time series dataset archive, looking to see if TSC literature has overlooked the effectiveness of these approaches.
  arXiv  Detail & Related papers  (2022-01-28T11:23:58Z)
• Robust Augmentation for Multivariate Time Series Classification [20.38907456958682]
  We show that the simple methods of cutout, cutmix, mixup, and window warp improve the robustness and overall performance. We show that the InceptionTime network with augmentation improves accuracy by 1% to 45% in 18 different datasets.
  arXiv  Detail & Related papers  (2022-01-27T18:57:49Z)
• Theoretical Insights Into Multiclass Classification: A High-dimensional Asymptotic View [82.80085730891126]
  We provide the first modernally precise analysis of linear multiclass classification. Our analysis reveals that the classification accuracy is highly distribution-dependent. The insights gained may pave the way for a precise understanding of other classification algorithms.
  arXiv  Detail & Related papers  (2020-11-16T05:17:29Z)
• Coupled regularized sample covariance matrix estimator for multiple classes [14.41703014203756]
  We consider regularized SCM (RSCM) estimators for multiclass problems that couple together two different target matrices for regularization. We derive the MSE optimal tuning parameters for the estimators as well as propose a method for their estimation. The MSE performance of the proposed coupled RSCMs are evaluated with simulations and in a regularized discriminant analysis (RDA) classification set-up on real data.
  arXiv  Detail & Related papers  (2020-11-09T10:39:53Z)
• XEM: An Explainable-by-Design Ensemble Method for Multivariate Time Series Classification [61.33695273474151]
  We present XEM, an eXplainable-by-design Ensemble method for Multivariable time series classification. XEM relies on a new hybrid ensemble method that combines an explicit boosting-bagging approach and an implicit divide-and-conquer approach. Our evaluation shows that XEM outperforms the state-of-the-art MTS classifiers on the public UEA datasets.
  arXiv  Detail & Related papers  (2020-05-07T17:50:18Z)
• Supervised Feature Subset Selection and Feature Ranking for Multivariate Time Series without Feature Extraction [78.84356269545157]
  We introduce supervised feature ranking and feature subset selection algorithms for MTS classification. Unlike most existing supervised/unsupervised feature selection algorithms for MTS our techniques do not require a feature extraction step to generate a one-dimensional feature vector from the time series.
  arXiv  Detail & Related papers  (2020-05-01T07:46:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.