Filters








20,679 Hits in 11.8 sec

The One-Way Communication Complexity of Dynamic Time Warping Distance [article]

Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang
2019 arXiv   pre-print
We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance.  ...  We show that there is an efficient one-way communication protocol using O(n/α) bits for the problem of computing an α-approximation for DTW between strings x and y of length n, and we prove a lower bound  ...  Dynamic Time Warping Distance We study the dynamic warping distance (DTW) of strings x, y ∈ Σ ≤n .  ... 
arXiv:1903.03520v1 fatcat:waggmcrupjeavli26pzahulcnq

The One-Way Communication Complexity of Dynamic Time Warping Distance

Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang, Michael Wagner
2019 International Symposium on Computational Geometry  
We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance.  ...  We show that there is an efficient one-way communication protocol using O(n/α) bits for the problem of computing an α-approximation for DTW between strings x and y of length n, and we prove a lower bound  ...  Woodruff would like to thank the Simons Institute for the Theory of Computing where part of this work was done.  ... 
doi:10.4230/lipics.socg.2019.16 dblp:conf/compgeom/BravermanCKWY19 fatcat:far4oxhsynggvdcjkymfmuzu6i

The one-way communication complexity of dynamic time warping distance

Vladimir Braverman, Moses Charikar, William Kuszmaul, Lin F Yang
2020
We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance.  ...  We show that there is an efficient one-way communication protocol using $\widetilde{O}(n/\alpha)$ bits for the problem of computing an $\alpha$-approximation for DTW between strings $x$ and $y$ of length  ...  Dynamic Time Warping Distance We study the dynamic warping distance (DTW) of strings x, y ∈ Σ ≤n .  ... 
doi:10.20382/jocg.v11i2a4 fatcat:w6lwm6mad5ce3bvhk7pvfdizhi

Computational Analysis of Gaze Behavior in Autism During Interaction with Virtual Agents

Zeeshan Akhtar, Tanaya Guha
2019 ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
We also observe reduced complexity in the pupil response dynamics, and lower synchrony between pupil response and fixation pattern in the ASD group.  ...  Our results indicate that communicators facial expressions can significantly affect the gaze behavior of the ASD subjects.  ...  Dynamic time warping: To investigate the synchrony between the pupil response and fixation patterns, we employ the dynamical time warping (DTW) method.  ... 
doi:10.1109/icassp.2019.8682943 dblp:conf/icassp/AkhtarG19 fatcat:j6wrh7hrb5c2lpt4qvwewqlj4u

A Time Series Clustering Technique based on Community Detection in Networks

Leonardo N. Ferreira, Liang Zhao
2015 Procedia Computer Science  
In this paper, we propose a technique for time series clustering via community detection in complex networks.  ...  Time series clustering is a research topic of practical importance in temporal data mining. The goal is to identify groups of similar time series in a data base.  ...  We thank the University of São Paulo for providing the computational infrastructure of the cloud computing that allowed the experiments. We would like to thank Prof.  ... 
doi:10.1016/j.procs.2015.07.293 fatcat:lt5ni3qkbvfdfmkhsqgmftpw74

Scaling up dynamic time warping for datamining applications

Eamonn J. Keogh, Michael J. Pazzani
2000 Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '00  
Dynamic time warping (DTW) has been suggested as a technique to allow more robust distance calculations, however it is computationally expensive.  ...  In this paper we introduce a modification of DTW which operates on a higher level abstraction of the data, in particular, a Piecewise Aggregate Approximation (PAA).  ...  The technique, Dynamic Time Warping (DTW), was introduced to the data mining community by Berndt and Clifford [3] .  ... 
doi:10.1145/347090.347153 dblp:conf/kdd/KeoghP00 fatcat:32oodiqc4veaxkrnkqhobgwc6y

Fast time series classification under lucky time warping distance

Stephan Spiegel, Brijnesh-Johannes Jain, Sahin Albayrak
2014 Proceedings of the 29th Annual ACM Symposium on Applied Computing - SAC '14  
In time series mining, the Dynamic Time Warping (DTW) distance is a commonly and widely used similarity measure.  ...  Since the computational complexity of the DTW distance is quadratic, various kinds of warping constraints, lower bounds and abstractions have been developed to speed up time series mining under DTW distance  ...  INTRODUCTION The Dynamic Time Warping (DTW) distance was first introduced to the data mining community almost two decades ago [2] , and since then has been used as a utility for various time series mining  ... 
doi:10.1145/2554850.2554885 dblp:conf/sac/SpiegelJA14 fatcat:7af3vgma2vbgtbw7idwciwitxa

SparseDTW: A Novel Approach to Speed up Dynamic Time Warping [article]

Ghazi Al-Naymat, Sanjay Chawla, Javid Taheri
2012 arXiv   pre-print
We present a new space-efficient approach, (SparseDTW), to compute the Dynamic Time Warping (DTW) distance between two time series that always yields the optimal result.  ...  The main idea behind our approach is to dynamically exploit the existence of similarity and/or correlation between the time series.  ...  Figures 1(a) and 1(b) demonstrate an example of how two time series (S and Q) are warped and the way their distance is calculated.  ... 
arXiv:1201.2969v1 fatcat:obt3bt2gkzhy7m5szxbqmbc7vm

A multidimensional dynamic time warping algorithm for efficient multimodal fusion of asynchronous data streams

Martin Wöllmer, Marc Al-Hames, Florian Eyben, Björn Schuller, Gerhard Rigoll
2009 Neurocomputing  
To overcome the computational complexity of the asynchronous hidden Markov model (AHMM), we present a novel multidimensional dynamic time warping (DTW) algorithm for hybrid fusion of asynchronous data.  ...  Thus, it can be applied in a wide range of real-time multimodal classification tasks.  ...  Acknowledgments The research leading to these results has received funding from the European Community's Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 211486 (SEMAINE).  ... 
doi:10.1016/j.neucom.2009.08.005 fatcat:zwlxz67dzfdqfjmnikvud2bstm

Scaling up Dynamic Time Warping to Massive Datasets [chapter]

Eamonn J. Keogh, Michael J. Pazzani
1999 Lecture Notes in Computer Science  
Dynamic time warping (DTW) has been suggested as a technique to allow more robust distance calculations, however it is computationally expensive.  ...  In this paper we introduce a modification of DTW which operates on a higher level abstraction of the data, in particular, a piecewise linear representation.  ...  The technique, Dynamic Time Warping (DTW), was introduced to the data mining community by Berndt and Clifford (1994) .  ... 
doi:10.1007/978-3-540-48247-5_1 fatcat:oa6aaigfjffjnpmf4dgmftg2qm

NeuralWarp: Time-Series Similarity with Warping Networks [article]

Josif Grabocka, Lars Schmidt-Thieme
2018 arXiv   pre-print
Research on time-series similarity measures has emphasized the need for elastic methods which align the indices of pairs of time series and a plethora of non-parametric have been proposed for the task.  ...  In this paper, we propose NeuralWarp, a novel measure that models the alignment of time-series indices in a deep representation space, by modeling a warping function as an upper level neural network between  ...  ACKNOWLEDGEMENT We acknowledge the funding provided by the "Zentrales Innovationsprogramm Mi elstand" of the German Federal Ministry for Economic A airs and Energy through the project ADDA. e authors thank  ... 
arXiv:1812.08306v1 fatcat:yu6quptcfjbfpgbrfu4o2kidyu

Natural language processing

2015 2015 International Symposium on Advanced Computing and Communication (ISACC)  
These coefficients are subjected to feature matching through Dynamic Time Warping to match with the patterns existing in the database for limited Tamil words.  ...  A system that recognizes and authenticates the voice of a user by extracting the distinct features of their voice samples is usually termed as Voice recognition system.  ...  In the feature matching module it identifies the Tamil words and the user using the Dynamic Time Warping algorithm that computes the warping distance between two time sequences.  ... 
doi:10.1109/isacc.2015.7377321 fatcat:rsagwstj75dqlaudvlvc5uhwjy

Natural language processing

Yorick Wilks
1996 Communications of the ACM  
These coefficients are subjected to feature matching through Dynamic Time Warping to match with the patterns existing in the database for limited Tamil words.  ...  A system that recognizes and authenticates the voice of a user by extracting the distinct features of their voice samples is usually termed as Voice recognition system.  ...  In the feature matching module it identifies the Tamil words and the user using the Dynamic Time Warping algorithm that computes the warping distance between two time sequences.  ... 
doi:10.1145/234173.234180 fatcat:62zdpwodmjbdhgycbl4zxnj4lq

Natural language processing

Helmut Horacek
1990 Computer Physics Communications  
These coefficients are subjected to feature matching through Dynamic Time Warping to match with the patterns existing in the database for limited Tamil words.  ...  A system that recognizes and authenticates the voice of a user by extracting the distinct features of their voice samples is usually termed as Voice recognition system.  ...  In the feature matching module it identifies the Tamil words and the user using the Dynamic Time Warping algorithm that computes the warping distance between two time sequences.  ... 
doi:10.1016/0010-4655(90)90107-c fatcat:fjj4xqlmszenpdlelmarfh6qxe

Three Myths about Dynamic Time Warping Data Mining [chapter]

Chotirat Ann Ratanamahatana, Eamonn Keogh
2005 Proceedings of the 2005 SIAM International Conference on Data Mining  
The Dynamic Time Warping (DTW) distance measure is a technique that has long been known in speech recognition community.  ...  It allows a non-linear mapping of one signal to another by minimizing the distance between the two.  ...  A decade ago, the Dynamic Time Warping (DTW) distance measure was introduced to the data mining community as a solution to this particular weakness of Euclidean distance metric [2] .  ... 
doi:10.1137/1.9781611972757.50 dblp:conf/sdm/RatanamahatanaK05 fatcat:xt4s4svsurcolbxfhjdfd6tdxe
« Previous Showing results 1 — 15 out of 20,679 results