Improved Time Warp Edit Distance -- A Parallel Dynamic Program in Linear Memory

2020-07-31 · Garrett Wright

Edit Distance is a classic family of dynamic programming problems, among which Time Warp Edit Distance refines the problem with the notion of a metric and temporal elasticity. A novel Improved Time Warp Edit Distance algorithm that is both massively parallelizable and requiring only linear storage is presented. This method uses the procession of a three diagonal band to cover the original dynamic program space. Every element of the diagonal update can be computed in parallel. The core method is a feature of the TWED Longest Common Subsequence data dependence and is applicable to dynamic programs that share similar band subproblem structure. The algorithm has been implemented as a CUDA C library with Python bindings. Speedups for challenging problems are phenomenal.

📄 PDF Abstract BibTeX arXiv:2007.16135

Code (0)

등록된 구현이 없습니다.

Autowarp: Learning a Warping Distance from Unlabeled Time Series Using Sequence Autoencoders

2018-10-23 · NeurIPS 2018 · Abubakar Abid, James Zou

Measuring similarities between unlabeled time series trajectories is an important problem in domains as diverse as medicine, astronomy, finance, and computer vision. It is often unclear what is the appropriate metric to …

Astronomy Dynamic Time Warping Time Series Time Series Analysis

A Review and Evaluation of Elastic Distance Functions for Time Series Clustering

2022-05-30 · Chris Holder, Matthew Middlehurst, Anthony Bagnall

Time series clustering is the act of grouping time series data without recourse to a label. Algorithms that cluster time series can be classified into two groups: those that employ a time series specific distance measure…

Clustering Dynamic Time Warping Time Series Time Series Analysis+1

On Recursive Edit Distance Kernels with Application to Time Series Classification

2010-05-27 · Pierre-François Marteau, Sylvie Gibet

This paper proposes some extensions to the work on kernels dedicated to string or time series global alignment based on the aggregation of scores obtained by local alignments. The extensions we propose allow to construct…

General Classification Time Series Time Series Analysis Time Series Classification

Learning a Warping Distance from Unlabeled Time Series Using Sequence Autoencoders

2018-12-01 · NeurIPS 2018 12 · Abubakar Abid, James Y. Zou

Measuring similarities between unlabeled time series trajectories is an important problem in many domains such as medicine, economics, and vision. It is often unclear what is the appropriate metric to use because of the …

Dynamic Time Warping Time Series Time Series Analysis

Making the Dynamic Time Warping Distance Warping-Invariant

2019-03-04 · Brijnesh Jain

The literature postulates that the dynamic time warping (dtw) distance can cope with temporal variations but stores and processes time series in a form as if the dtw-distance cannot cope with such variations. To address …