paper-with-me

Papers

Amercing: An Intuitive, Elegant and Effective Constraint for Dynamic Time Warping

2021-11-26 · Matthieu Herrmann, Geoffrey I. Webb

Dynamic Time Warping (DTW), and its constrained (CDTW) and weighted (WDTW) variants, are time series distances with a wide range of applications. They minimize the cost of non-linear alignments between series. CDTW and WDTW have been introduced because DTW is too permissive in its alignments. However, CDTW uses a crude step function, allowing unconstrained flexibility within the window, and none beyond it. WDTW's multiplicative weight is relative to the distances between aligned points along a warped path, rather than being a direct function of the amount of warping that is introduced. In this paper, we introduce Amerced Dynamic Time Warping (ADTW), a new, intuitive, DTW variant that penalizes the act of warping by a fixed additive cost. Like CDTW and WDTW, ADTW constrains the amount of warping. However, it avoids both abrupt discontinuities in the amount of warping allowed and the limitations of a multiplicative penalty. We formally introduce ADTW, prove some of its properties, and discuss its parameterization. We show on a simple example how it can be parameterized to achieve an intuitive outcome, and demonstrate its usefulness on a standard time series classification benchmark. We provide a demonstration application in C++.

📄 PDF Abstract BibTeX arXiv:2111.13314

Code (1)

MonashTS/tempo

Tasks

Dynamic Time WarpingTime SeriesTime Series AnalysisTime Series Classification

Methods 이 논문이 사용한 방법론

DTW Dynamic Time Warping (DTW) [1] is one of well-known distance measures between a pairwise of time series. The main idea of DTW is to compute the distance from the matching of…

Similar Papers 제목 키워드 기반

Latent Variable Session-Based Recommendation

2019-04-24 · pproximateinference AABI Symposium 2019 12 · David Rohde, Stephen Bonner

Session based recommendation provides an attractive alternative to the traditional feature engineering approach to recommendation. Feature engineering approaches require hand tuned features of the users history to be cre…

Feature EngineeringSession-Based Recommendations

Local Rademacher Complexity Bounds based on Covering Numbers

2015-10-06 · Yunwen Lei, Lixin Ding, Yingzhou Bi

This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constrai…

Fourier Neural Operators Explained: A Practical Perspective

2025-12-01 · Valentin Duruisseaux, Jean Kossaifi, Anima Anandkumar arxiv

Partial differential equations (PDEs) govern a wide variety of dynamical processes in science and engineering, yet obtaining their numerical solutions often requires high-resolution discretizations and repeated evaluatio…

Modeling (Deontic) Modal Operators With the s(CASP) Goal-directed Predicate Answer Set Programming System

2025-07-07 · Gopal Gupta, Abhiramon Rajasekharan, Alexis R. Tudor, Elmer Salazar 외

We consider the problem of implementing deontic modal logic. We show how (deontic) modal operators can be expressed elegantly using default negation (negation-as-failure) and strong negation present in answer set program…

Negation

Set-based and Dynamical Feedback-augmented Hands-off Control

2025-03-14 · Andrei Sperilă, Sorin Olaru, Stéphane Drobot

A novel set-theoretical approach to hands-off control is proposed, which focuses on spatial arguments for command limitation, rather than temporal ones. By employing dynamical feedback alongside invariant set-based const…