Results 121 to 130 of about 10,387 (161)
Some of the next articles are maybe not open access.
Clustering Paths With Dynamic Time Warping
2020 Working Conference on Software Visualization (VISSOFT), 2020Studying software visualization often includes the evaluation of paths collected from participants of a study (e.g., eye tracking or movements in virtual worlds). In this paper, we explore clustering techniques to automate the process of grouping similar paths.
Rainer Koschke, Marcel Steinbeck
openaire +1 more source
Quaternion Dynamic Time Warping
IEEE Transactions on Signal Processing, 2012Dynamic time warping (DTW) is used for the comparison and processing of nonlinear signals and constitutes a widely researched field of study. The method has been initially designed for, and applied to, signals representing audio data. Afterwords it has been successfully modified and applied to many other fields of study.
openaire +1 more source
2017
Dynamic time warping (DTW) has been applied to a wide range of machine learning problems involving the comparison of time series. An important feature of such time series is that they can sometimes be sparse in the sense that the data takes zero value at many epochs.
Youngha Hwang, Saul B. Gelfand
openaire +1 more source
Dynamic time warping (DTW) has been applied to a wide range of machine learning problems involving the comparison of time series. An important feature of such time series is that they can sometimes be sparse in the sense that the data takes zero value at many epochs.
Youngha Hwang, Saul B. Gelfand
openaire +1 more source
Constrained Sparse Dynamic Time Warping
2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA), 2018Dynamic time warping (DTW) has been applied to a wide range of machine learning problems involving the comparison of time series. An important feature of such time series is that they can sometimes be sparse in the sense that the data takes zero value at many epochs.
Youngha Hwang, Saul B. Gelfand
openaire +1 more source
Exact indexing of dynamic time warping
Knowledge and Information Systems, 2005The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has been forcefully shown that the Euclidean distance is a very brittle distance measure.
Eamonn J. Keogh +1 more
openaire +1 more source
1984
Two programs are provided, one that generates Ipc and autocorrelation coefficients from the speech utterances and the other that, using dynamic programming, compares the test utterance with the reference utterances and finds the best match. The method used is Constrained Endpoint with 2-to-l range of slope.
Alan Bundy, Lincoln Wallen
openaire +1 more source
Two programs are provided, one that generates Ipc and autocorrelation coefficients from the speech utterances and the other that, using dynamic programming, compares the test utterance with the reference utterances and finds the best match. The method used is Constrained Endpoint with 2-to-l range of slope.
Alan Bundy, Lincoln Wallen
openaire +1 more source
Dynamic frequency warping, the dual of dynamic time warping
The Journal of the Acoustical Society of America, 1987Comparison of two tokens of the same utterance is central to many automatic speech recognition systems. Matching is usually done in the frequency-time domain; token matching is effectively spectrogram matching. Dynamic time warping (DTW) overcomes, to some extent, the temporal variability of speech tokens; spectrograms are time-aligned by calculating ...
openaire +1 more source
On the metric properties of dynamic time warping
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1987Recently, some new and promising methods have been proposed to reduce the number of Dynamic Time Warping (DTW) computations in Isolated Word Recognition. For these methods to be properly applicable, the verification of the Triangle Inequality (TI) by the DTW-based Dissimilarity Measure utilized seems to be an important prerequisite.
Francisco Casacuberta +2 more
openaire +1 more source
Dynamic Time Warping of Segmented Time Series
2010Providing the most suitable time series representation has always been a crucial factor in time series data mining. The selected approximation does not only determine the tightness of the representation but also the (dis)similarity measure to be used. Piecewise Linear Representation (PLA) is one of the most popular methods when tight representation of ...
Zoltán Bankó, János Abonyi
openaire +1 more source
Keystroke dynamics for authentication using dynamic time warping
2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE), 2017Stolen credential incident is rising nowadays, most of the cyber attacks have been targeting user credential which could be easily abused. The usage of behavioral biometric is predicted to be increasing in order to encounter such act by authenticating user using multi-factor authentication of both password and behavioral biometrics to stop illegitimate
Made Indra Wira Pramana +3 more
openaire +1 more source