Pith. sign in

Unsupervised Scalable Representation Learning for Multivariate Time Series

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Time series constitute a challenging data type for machine learning algorithms, due to their highly variable lengths and sparse labeling in practice. In this paper, we tackle this challenge by proposing an unsupervised method to learn universal embeddings of time series. Unlike previous works, it is scalable with respect to their length and we demonstrate the quality, transferability and practicability of the learned representations with thorough experiments and comparisons. To this end, we combine an encoder based on causal dilated convolutions with a novel triplet loss employing time-based negative sampling, obtaining general-purpose representations for variable length and multivariate time series.

fields

cs.LG 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

ST-Tree with Interpretability for Multivariate Time Series Classification

cs.LG · 2024-11-18 · conditional · novelty 4.0

ST-Tree couples a Swin Transformer feature extractor with a prototype-based neural tree, reporting average accuracy of 0.789 on 10 UEA multivariate time series datasets, with visualizations of node prototypes as evidence of interpretability.

citing papers explorer

Showing 1 of 1 citing paper.

  • ST-Tree with Interpretability for Multivariate Time Series Classification cs.LG · 2024-11-18 · conditional · none · ref 20 · internal anchor

    ST-Tree couples a Swin Transformer feature extractor with a prototype-based neural tree, reporting average accuracy of 0.789 on 10 UEA multivariate time series datasets, with visualizations of node prototypes as evidence of interpretability.