Elastic Similarity Measures for Multivariate Time Series Classification
- URL: http://arxiv.org/abs/2102.10231v1
- Date: Sat, 20 Feb 2021 02:24:33 GMT
- Title: Elastic Similarity Measures for Multivariate Time Series Classification
- Authors: Ahmed Shifaz, Charlotte Pelletier, Francois Petitjean, Geoffrey I.
Webb
- Abstract summary: Elastic similarity measures are a class of similarity measures specifically designed to work with time series data.
Elastic similarity measures are widely used in machine learning tasks such as classification, clustering and outlier detection.
- Score: 4.5669999076671655
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Elastic similarity measures are a class of similarity measures specifically
designed to work with time series data. When scoring the similarity between two
time series, they allow points that do not correspond in timestamps to be
aligned. This can compensate for misalignments in the time axis of time series
data, and for similar processes that proceed at variable and differing paces.
Elastic similarity measures are widely used in machine learning tasks such as
classification, clustering and outlier detection when using time series data.
There is a multitude of research on various univariate elastic similarity
measures. However, except for multivariate versions of the well known Dynamic
Time Warping (DTW) there is a lack of work to generalise other similarity
measures for multivariate cases. This paper adapts two existing strategies used
in multivariate DTW, namely, Independent and Dependent DTW, to several commonly
used elastic similarity measures.
Using 23 datasets from the University of East Anglia (UEA) multivariate
archive, for nearest neighbour classification, we demonstrate that each measure
outperforms all others on at least one dataset and that there are datasets for
which either the dependent versions of all measures are more accurate than
their independent counterparts or vice versa. This latter finding suggests that
these differences arise from a fundamental property of the data. We also show
that an ensemble of such nearest neighbour classifiers is highly competitive
with other state-of-the-art multivariate time series classifiers.
Related papers
- Compatible Transformer for Irregularly Sampled Multivariate Time Series [75.79309862085303]
We propose a transformer-based encoder to achieve comprehensive temporal-interaction feature learning for each individual sample.
We conduct extensive experiments on 3 real-world datasets and validate that the proposed CoFormer significantly and consistently outperforms existing methods.
arXiv Detail & Related papers (2023-10-17T06:29:09Z) - DTW+S: Shape-based Comparison of Time-series with Ordered Local Trend [4.6380010540165655]
We develop a measure that looks for similar trends occurring around similar times and is easily interpretable.
We propose a novel measure, DTW+S, which creates an interpretable "closeness-preserving" matrix representation of the time-series.
We show that DTW+S is the only measure able to produce good clustering compared to the baselines.
arXiv Detail & Related papers (2023-09-07T09:18:12Z) - Robust Detection of Lead-Lag Relationships in Lagged Multi-Factor Models [61.10851158749843]
Key insights can be obtained by discovering lead-lag relationships inherent in the data.
We develop a clustering-driven methodology for robust detection of lead-lag relationships in lagged multi-factor models.
arXiv Detail & Related papers (2023-05-11T10:30:35Z) - Towards Similarity-Aware Time-Series Classification [51.2400839966489]
We study time-series classification (TSC), a fundamental task of time-series data mining.
We propose Similarity-Aware Time-Series Classification (SimTSC), a framework that models similarity information with graph neural networks (GNNs)
arXiv Detail & Related papers (2022-01-05T02:14:57Z) - Kernel distance measures for time series, random fields and other
structured data [71.61147615789537]
kdiff is a novel kernel-based measure for estimating distances between instances of structured data.
It accounts for both self and cross similarities across the instances and is defined using a lower quantile of the distance distribution.
Some theoretical results are provided for separability conditions using kdiff as a distance measure for clustering and classification problems.
arXiv Detail & Related papers (2021-09-29T22:54:17Z) - Instance-wise Graph-based Framework for Multivariate Time Series
Forecasting [69.38716332931986]
We propose a simple yet efficient instance-wise graph-based framework to utilize the inter-dependencies of different variables at different time stamps.
The key idea of our framework is aggregating information from the historical time series of different variables to the current time series that we need to forecast.
arXiv Detail & Related papers (2021-09-14T07:38:35Z) - Free congruence: an exploration of expanded similarity measures for time
series data [0.0]
Time series similarity measures are highly relevant in a wide range of emerging applications including training machine learning models, classification, and predictive modeling.
Standard similarity measures for time series most often involve point-to-point distance measures including Euclidean distance and Dynamic Time Warping.
arXiv Detail & Related papers (2021-01-17T23:34:55Z) - A Case-Study on the Impact of Dynamic Time Warping in Time Series
Regression [2.639737913330821]
We show that Dynamic Time Warping (DTW) is effective in improving accuracy on a regression task when only a single wavelength is considered.
When combined with k-Nearest Neighbour, DTW has the added advantage that it can reveal similarities and differences between samples at the level of the time-series.
However, in the problem, we consider here data is available across a spectrum of wavelengths.
arXiv Detail & Related papers (2020-10-11T15:21:21Z) - Benchmarking Multivariate Time Series Classification Algorithms [69.12151492736524]
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.
arXiv Detail & Related papers (2020-07-26T15:56:40Z) - A Deep Structural Model for Analyzing Correlated Multivariate Time
Series [11.009809732645888]
We present a deep learning structural time series model which can handle correlated multivariate time series input.
The model explicitly learns/extracts the trend, seasonality, and event components.
We compare our model with several state-of-the-art methods through a comprehensive set of experiments on a variety of time series data sets.
arXiv Detail & Related papers (2020-01-02T18:48: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.