Abstract

Averaging is an important step in time series classification or clustering, to create representative sequences for each category of data. A global averaging method for Dynamic Time Warping (DTW) based time series analysis is DTW Barycenter Averaging (DBA). In this paper, we propose a recursive tree based implementation of DBA, for faster computation of an average sequence, using the divide-and-conquer strategy. We also propose to automate the termination of DBA using a data-driven approach. The performance of the proposed methods is evaluated using accuracy, precision and recall as performance metrics, in a simple DTW-distance based classification method on ten standard time series datasets. Experimental results demonstrate that the proposed approaches are significantly faster than DBA, while achieving similar performance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.