Time series classification with feature covariance matrices

Ergezer H., Leblebicioglu K.

KNOWLEDGE AND INFORMATION SYSTEMS, vol.55, no.3, pp.695-718, 2018 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 55 Issue: 3
  • Publication Date: 2018
  • Doi Number: 10.1007/s10115-017-1098-1
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.695-718
  • Keywords: Time series classification, Time series representation, Feature covariance matrices, POSITIVE-DEFINITE MATRICES, REPRESENTATION, RECOGNITION, DESCRIPTOR, KERNEL
  • Middle East Technical University Affiliated: Yes


In this work, a novel approach utilizing feature covariance matrices is proposed for time series classification. In order to adapt the feature covariance matrices into time series classification problem, a feature vector is defined for each point in a time series. The feature vector comprises local and global information such as value, derivative, rank, deviation from the mean, the time index of the point and cumulative sum up to the point. Extracted feature vectors for the time instances are concatenated to construct feature matrices for the overlapping subsequences. Covariances of the feature matrices are used to describe the subsequences. Our main purpose in this work is to introduce and evaluate the feature covariance representation for time series classification. Therefore, in classification stage, firstly, 1-NN classifier is utilized. After showing the effectiveness of the representation with 1-NN classifier, the experiments are repeated with SVM classifier. The other novelty in this work is that a novel distance measure is introduced for time series by feature covariance matrix representation. Conducted experiments on UCR time series datasets show that the proposed method mostly outperforms the well-known methods such as DTW, shapelet transform and other state-of-the-art techniques.