Convolutional and Deep Learning based techniques for Time Series Ordinal Classification

• URL: http://arxiv.org/abs/2306.10084v3
• Date: Tue, 12 Nov 2024 15:32:40 GMT
• Title: Convolutional and Deep Learning based techniques for Time Series Ordinal Classification
• Authors: Rafael Ayllón-Gavilán, David Guijo-Rubio, Pedro Antonio Gutiérrez, Anthony Bagnall, César Hervás-Martínez,
• Abstract summary: 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.
• Score: 7.047582157120573
• License:
• Abstract: Time Series Classification (TSC) covers the supervised learning problem where input data is provided in the form of series of values observed through repeated measurements over time, and whose objective is to predict the category to which they belong. When the class values are ordinal, classifiers that take this into account can perform better than nominal classifiers. Time Series Ordinal Classification (TSOC) is the field covering this gap, yet unexplored in the literature. There are a wide range of time series problems showing an ordered label structure, and TSC techniques that ignore the order relationship discard useful information. Hence, 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. Both convolutional- and deep learning-based methodologies (among the best performing alternatives for nominal TSC) are adapted for TSOC. For the experiments, a selection of 29 ordinal problems from two well-known archives has been made. In this way, this paper contributes to the establishment of the state-of-the-art in TSOC. The results obtained by ordinal versions are found to be significantly better than current nominal TSC techniques in terms of ordinal performance metrics, outlining the importance of considering the ordering of the labels when dealing with this kind of problems.

Related papers

• Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification [60.28913031192201]
  We present a novel language-driven ordering alignment method for ordinal classification. Recent developments in pre-trained vision-language models inspire us to leverage the rich ordinal priors in human language. Experiments on three ordinal classification tasks, including facial age estimation, historical color image (HCI) classification, and aesthetic assessment demonstrate its promising performance.
  arXiv  Detail & Related papers  (2023-06-24T04:11:31Z)
• ProTeCt: Prompt Tuning for Taxonomic Open Set Classification [59.59442518849203]
  Few-shot adaptation methods do not fare well in the taxonomic open set (TOS) setting. We propose a prompt tuning technique that calibrates the hierarchical consistency of model predictions. A new Prompt Tuning for Hierarchical Consistency (ProTeCt) technique is then proposed to calibrate classification across label set granularities.
  arXiv  Detail & Related papers  (2023-06-04T02:55:25Z)
• A Dictionary-based approach to Time Series Ordinal Classification [0.0]
  We present an ordinal adaptation of the TDE algorithm, known as ordinal TDE (O-TDE) Experiments conducted show the improvement achieved by the ordinal dictionary-based approach in comparison to four other existing nominal dictionary-based techniques.
  arXiv  Detail & Related papers  (2023-05-16T08:48:36Z)
• Dynamic Conceptional Contrastive Learning for Generalized Category Discovery [76.82327473338734]
  Generalized category discovery (GCD) aims to automatically cluster partially labeled data. Unlabeled data contain instances that are not only from known categories of the labeled data but also from novel categories. One effective way for GCD is applying self-supervised learning to learn discriminate representation for unlabeled data. We propose a Dynamic Conceptional Contrastive Learning framework, which can effectively improve clustering accuracy.
  arXiv  Detail & Related papers  (2023-03-30T14:04:39Z)
• Parametric Classification for Generalized Category Discovery: A Baseline Study [70.73212959385387]
  Generalized Category Discovery (GCD) aims to discover novel categories in unlabelled datasets using knowledge learned from labelled samples. We investigate the failure of parametric classifiers, verify the effectiveness of previous design choices when high-quality supervision is available, and identify unreliable pseudo-labels as a key problem. We propose a simple yet effective parametric classification method that benefits from entropy regularisation, achieves state-of-the-art performance on multiple GCD benchmarks and shows strong robustness to unknown class numbers.
  arXiv  Detail & Related papers  (2022-11-21T18:47:11Z)
• 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)
• Fast, Accurate and Interpretable Time Series Classification Through Randomization [20.638480955703102]
  Time series classification (TSC) aims to predict the class label of a given time series. We propose a novel TSC method - the Randomized-Supervised Time Series Forest (r-STSF) r-STSF is highly efficient, achieves state-of-the-art classification accuracy and enables interpretability.
  arXiv  Detail & Related papers  (2021-05-31T10:59:11Z)
• Classification of multivariate weakly-labelled time-series with attention [0.0]
  Weakly labelled time-series are time-series containing noise and significant redundancies. This paper proposes an approach of exploiting context relevance of subsequences to improve classification accuracy.
  arXiv  Detail & Related papers  (2021-02-16T16:05:38Z)
• Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification [94.55805516167369]
  We propose a new approach for binary classification from m U-sets for $mge2$. Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC)
  arXiv  Detail & Related papers  (2021-02-01T07:36:38Z)
• 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)

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.