Approximating DTW with a convolutional neural network on EEG data

• URL: http://arxiv.org/abs/2301.12873v1
• Date: Mon, 30 Jan 2023 13:27:47 GMT
• Title: Approximating DTW with a convolutional neural network on EEG data
• Authors: Hugo Lerogeron, Romain Picot-Clemente, Alain Rakotomamonjy, Laurent Heutte
• Abstract summary: We propose a fast and differentiable approximation of Dynamic Time Wrapping (DTW) We show that our methods achieve at least the same level of accuracy as other DTW main approximations with higher computational efficiency.
• Score: 9.409281517596396
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dynamic Time Wrapping (DTW) is a widely used algorithm for measuring similarities between two time series. It is especially valuable in a wide variety of applications, such as clustering, anomaly detection, classification, or video segmentation, where the time-series have different timescales, are irregularly sampled, or are shifted. However, it is not prone to be considered as a loss function in an end-to-end learning framework because of its non-differentiability and its quadratic temporal complexity. While differentiable variants of DTW have been introduced by the community, they still present some drawbacks: computing the distance is still expensive and this similarity tends to blur some differences in the time-series. In this paper, we propose a fast and differentiable approximation of DTW by comparing two architectures: the first one for learning an embedding in which the Euclidean distance mimics the DTW, and the second one for directly predicting the DTW output using regression. We build the former by training a siamese neural network to regress the DTW value between two time-series. Depending on the nature of the activation function, this approximation naturally supports differentiation, and it is efficient to compute. We show, in a time-series retrieval context on EEG datasets, that our methods achieve at least the same level of accuracy as other DTW main approximations with higher computational efficiency. We also show that it can be used to learn in an end-to-end setting on long time series by proposing generative models of EEGs.

Related papers

• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• Deep Ensembles Meets Quantile Regression: Uncertainty-aware Imputation for Time Series [49.992908221544624]
  Time series data often exhibit numerous missing values, which is the time series imputation task. Previous deep learning methods have been shown to be effective for time series imputation. We propose a non-generative time series imputation method that produces accurate imputations with inherent uncertainty.
  arXiv  Detail & Related papers  (2023-12-03T05:52:30Z)
• OTW: Optimal Transport Warping for Time Series [75.69837166816501]
  Dynamic Time Warping (DTW) has become the pragmatic choice for measuring distance between time series. It suffers from unavoidable quadratic time complexity when the optimal alignment matrix needs to be computed exactly. We introduce a new metric for time series data based on the Optimal Transport framework, called Optimal Transport Warping (OTW)
  arXiv  Detail & Related papers  (2023-06-01T12:45:00Z)
• Deep Declarative Dynamic Time Warping for End-to-End Learning of Alignment Paths [54.53208538517505]
  This paper addresses learning end-to-end models for time series data that include a temporal alignment step via dynamic time warping (DTW) We propose a DTW layer based around bi-level optimisation and deep declarative networks, which we name DecDTW. We show that this property is particularly useful for applications where downstream loss functions are defined on the optimal alignment path itself.
  arXiv  Detail & Related papers  (2023-03-19T21:58:37Z)
• LB-SimTSC: An Efficient Similarity-Aware Graph Neural Network for Semi-Supervised Time Series Classification [4.7828959446344275]
  We propose a new efficient semi-supervised time series classification technique, LB-SimTSC, with a new graph construction module. We construct the pairwise distance matrix using LB_Keogh and build a graph for the graph neural network. Results demonstrate that this approach can be up to 104x faster than SimTSC when constructing the graph on large datasets.
  arXiv  Detail & Related papers  (2023-01-12T06:49:55Z)
• MGADN: A Multi-task Graph Anomaly Detection Network for Multivariate Time Series [0.0]
  Anomaly detection of time series, especially multivariate time series(time series with multiple sensors), has been focused on for several years. Existing method including neural network only concentrate on the relationship in terms of timestamp. Our approach uses GAT, which is originated from graph neural network, to obtain connection between sensors. Our approach is also designed to be double headed to calculate both prediction loss and reconstruction loss via VAE(Variational Auto-Encoder).
  arXiv  Detail & Related papers  (2022-11-22T10:17:42Z)
• Gait Recognition in the Wild with Multi-hop Temporal Switch [81.35245014397759]
  gait recognition in the wild is a more practical problem that has attracted the attention of the community of multimedia and computer vision. This paper presents a novel multi-hop temporal switch method to achieve effective temporal modeling of gait patterns in real-world scenes.
  arXiv  Detail & Related papers  (2022-09-01T10:46:09Z)
• 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)
• TC-DTW: Accelerating Multivariate Dynamic Time Warping Through Triangle Inequality and Point Clustering [6.502892821109196]
  The most popular algorithm used today is still the one developed seventeen years ago. The new solution, named TC-DTW, introduces Triangle Inequality and Point Clustering into the algorithm design. In experiments on DTW-based nearest neighbor finding, the new solution avoids as much as 98% (60% average) DTW distance calculations and yields as much as 25X (7.5X average) speedups.
  arXiv  Detail & Related papers  (2021-01-15T16:38:28Z)
• 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)

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.