Skip to Main content Skip to Navigation
Conference papers

Flexible Global Constraint Extension for Dynamic Time Warping

Abstract : Dynamic Time Warping algorithm (DTW) is an effective tool for comparing two sequences which are subject to some kind of distortion. Unlike the standard methods for comparison, it is able to deal with a different length of compared sequences or with reasonable amount of inaccuracy. For this reason, DTW has become very popular and it is widely used in many domains. One of its the biggest advantages is a possibility to specify definable amount of benevolence while evaluating similarity of two sequences. It enables to percept similarity through the eyes of domain expert, in contrast with a strict sequential comparison of opposite sequence elements. Unfortunately, such commonly used definition of benevolence cannot be applied on DTW modifications, which were created for solving specific tasks (e.g. searching the longest common subsequence). The main goal of this paper is to eliminate weaknesses of commonly used approach and to propose a new flexible mechanism for definition of benevolence applicable to modifications of original DTW.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, November 17, 2017 - 3:43:47 PM
Last modification on : Saturday, June 1, 2019 - 11:34:02 AM
Long-term archiving on: : Sunday, February 18, 2018 - 3:58:43 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Tomáš Kocyan, Kateřina Slaninová, Jan Martinovič. Flexible Global Constraint Extension for Dynamic Time Warping. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.389-401, ⟨10.1007/978-3-319-45378-1_35⟩. ⟨hal-01637468⟩



Record views


Files downloads