{"title":"Averaging Methods using Dynamic Time Warping for Time Series Classification","authors":"Shreyasi Datta, C. Karmakar, M. Palaniswami","doi":"10.1109/SSCI47803.2020.9308409","DOIUrl":null,"url":null,"abstract":"Averaging is an important step in time series classi-fication 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.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"03 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI47803.2020.9308409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Averaging is an important step in time series classi-fication 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.