RED CoMETS: An ensemble classifier for symbolically represented
multivariate time series
- URL: http://arxiv.org/abs/2307.13679v2
- Date: Sat, 16 Sep 2023 20:11:40 GMT
- Title: RED CoMETS: An ensemble classifier for symbolically represented
multivariate time series
- Authors: Luca A. Bennett and Zahraa S. Abdallah
- Abstract summary: This paper introduces a novel ensemble classifier called RED CoMETS.
Red CoMETS builds upon the success of Co-eye, an ensemble classifier specifically designed for symbolically represented univariate time series.
It achieves the highest reported accuracy in the literature for the 'HandMovementDirection' dataset.
- Score: 1.0878040851638
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Multivariate time series classification is a rapidly growing research field
with practical applications in finance, healthcare, engineering, and more. The
complexity of classifying multivariate time series data arises from its high
dimensionality, temporal dependencies, and varying lengths. This paper
introduces a novel ensemble classifier called RED CoMETS (Random Enhanced
Co-eye for Multivariate Time Series), which addresses these challenges. RED
CoMETS builds upon the success of Co-eye, an ensemble classifier specifically
designed for symbolically represented univariate time series, and extends its
capabilities to handle multivariate data. The performance of RED CoMETS is
evaluated on benchmark datasets from the UCR archive, where it demonstrates
competitive accuracy when compared to state-of-the-art techniques in
multivariate settings. Notably, it achieves the highest reported accuracy in
the literature for the 'HandMovementDirection' dataset. Moreover, the proposed
method significantly reduces computation time compared to Co-eye, making it an
efficient and effective choice for multivariate time series classification.
Related papers
- MGCP: A Multi-Grained Correlation based Prediction Network for Multivariate Time Series [54.91026286579748]
We propose a Multi-Grained Correlations-based Prediction Network.
It simultaneously considers correlations at three levels to enhance prediction performance.
It employs adversarial training with an attention mechanism-based predictor and conditional discriminator to optimize prediction results at coarse-grained level.
arXiv Detail & Related papers (2024-05-30T03:32:44Z) - Time Series Clustering With Random Convolutional Kernels [0.0]
Time series data, spanning applications ranging from climatology to finance to healthcare, presents significant challenges in data mining.
One open issue lies in time series clustering, which is crucial for processing large volumes of unlabeled time series data.
We introduce R-Clustering, a novel method that utilizes convolutional architectures with randomly selected parameters.
arXiv Detail & Related papers (2023-05-17T06:25:22Z) - 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) - 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) - Multi-scale Attention Flow for Probabilistic Time Series Forecasting [68.20798558048678]
We propose a novel non-autoregressive deep learning model, called Multi-scale Attention Normalizing Flow(MANF)
Our model avoids the influence of cumulative error and does not increase the time complexity.
Our model achieves state-of-the-art performance on many popular multivariate datasets.
arXiv Detail & Related papers (2022-05-16T07:53:42Z) - Enhancing Transformer Efficiency for Multivariate Time Series
Classification [12.128991867050487]
We propose a methodology to investigate the relationship between model efficiency and accuracy, as well as its complexity.
Comprehensive experiments on benchmark MTS datasets illustrate the effectiveness of our method.
arXiv Detail & Related papers (2022-03-28T03:25:19Z) - Novel Features for Time Series Analysis: A Complex Networks Approach [62.997667081978825]
Time series data are ubiquitous in several domains as climate, economics and health care.
Recent conceptual approach relies on time series mapping to complex networks.
Network analysis can be used to characterize different types of time series.
arXiv Detail & Related papers (2021-10-11T13:46:28Z) - Multi-Time Attention Networks for Irregularly Sampled Time Series [18.224344440110862]
Irregular sampling occurs in many time series modeling applications.
We propose a new deep learning framework for this setting that we call Multi-Time Attention Networks.
Our results show that our approach performs as well or better than a range of baseline and recently proposed models.
arXiv Detail & Related papers (2021-01-25T18:57:42Z) - Multi-Faceted Representation Learning with Hybrid Architecture for Time
Series Classification [16.64345034889185]
We propose a hybrid neural architecture, called Self-Attentive Recurrent Convolutional Networks (SARCoN)
SARCoN is the synthesis of long short-term memory networks with self-attentive mechanisms and Fully Convolutional Networks.
Our work provides a novel angle that deepens the understanding of time series classification, qualifying our proposed model as an ideal choice for real-world applications.
arXiv Detail & Related papers (2020-12-21T16:42:07Z) - Interpretable Time Series Classification using Linear Models and
Multi-resolution Multi-domain Symbolic Representations [6.6147550436077776]
We propose new time series classification algorithms to address gaps in current approaches.
Our approach is based on symbolic representations of time series, efficient sequence mining algorithms and linear classification models.
Our models are as accurate as deep learning models but are more efficient regarding running time and memory, can work with variable-length time series and can be interpreted by highlighting the discriminative symbolic features on the original time series.
arXiv Detail & Related papers (2020-05-31T15:32:08Z) - 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.