Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Time series classification with feature covariance matrices
Date
2018-06-01
Author
Ergezer, Hamza
Leblebicioğlu, Mehmet Kemal
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
249
views
0
downloads
Cite This
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.
Subject Keywords
Time series classification
,
Time series representation
,
Feature covariance matrices
URI
https://hdl.handle.net/11511/42959
Journal
KNOWLEDGE AND INFORMATION SYSTEMS
DOI
https://doi.org/10.1007/s10115-017-1098-1
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Time Series Classification Using Point-wise Features
Ergezer, Hamza; Leblebicioğlu, Mehmet Kemal (2017-05-18)
In this work, a novel approach utilizing feature covariance matrices is proposed for time series classification. In order to adapt the feature covariance matrices for time series classification, 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, time index of the point and cumulative sum up to the point. Instead of representing the whole time series with a single covariance matrix, t...
Time series on riemannian manifolds
Ergezer, Hamza; Leblebicioğlu, Mehmet Kemal; Department of Electrical and Electronics Engineering (2017)
In this thesis, feature covariance matrices are utilized to solve several problems related to time series. In the first part of the thesis, a novel representation is proposed to represent the time series using feature covariance matrices. By this representation, time series are carried onto Riemannian manifold space. The proposed representation is firstly applied to trajectories which are essentially 2D time series. Anomaly detection and activity perception problems in crowded visual scenes are studied by usi...
Component extraction analysis of multivariate time series
Akman, I; DeGooijer, JG (1996-05-01)
A method for modelling several observed parallel time series is proposed. The method involves seeking possible common underlying pure AR and MA components in the series. The common components are forced to be mutually uncorrelated so that univariate time series modelling and forecasting techniques can be applied. The proposed method is shown to be a useful addition to the time series analyst's toolkit, if common sources of variation in multivariate data need to be quickly identified.
Consensus clustering of time series data
Yetere Kurşun, Ayça; Batmaz, İnci; İyigün, Cem; Department of Scientific Computing (2014)
In this study, we aim to develop a methodology that merges Dynamic Time Warping (DTW) and consensus clustering in a single algorithm. Mostly used time series distance measures require data to be of the same length and measure the distance between time series data mostly depends on the similarity of each coinciding data pair in time. DTW is a relatively new measure used to compare two time dependent sequences which may be out of phase or may not have the same lengths or frequencies. DTW aligns two time serie...
Continuous-time nonlinear estimation filters using UKF-aided gaussian sum representations
Gökçe, Murat; Kuzuoğlu, Mustafa; Department of Electrical and Electronics Engineering (2014)
A nonlinear filtering method is developed for continuous-time nonlinear systems with observations/measurements carried out in discrete-time by means of UKFaided Gaussian sum representations. The time evolution of the probability density function (pdf) of the state variables (or the a priori pdf) is approximated by solving the Fokker-Planck equation numerically using Euler’s method. At every Euler step, the values of the a priori pdf are evaluated at deterministic sample points. These values are used with Ga...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Ergezer and M. K. Leblebicioğlu, “Time series classification with feature covariance matrices,”
KNOWLEDGE AND INFORMATION SYSTEMS
, pp. 695–718, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42959.