AWarp: Fast Warping Distance for Sparse Time Series

• Published in: 2016 IEEE 16th International Conference on Data Mining (ICDM) pp. 350 - 359
• Main Authors: Mueen, Abdullah, Chavoshi, Nikan, Abu-El-Rub, Noor, Hamooni, Hossein, Minnich, Amanda
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2016
• Subjects: bot detection; Data mining; dynamic time warping distance; Encoding; Heuristic algorithms; run-length encoding; Signal processing algorithms; Sparse matrices; sparse time series; Time measurement; Time series analysis
• ISSN: 2374-8486
• DOI: 10.1109/ICDM.2016.0046

Dynamic Time Warping (DTW) distance has been effectively used in mining time series data in a multitude of domains. However, in its original formulation DTW is extremely inefficient in comparing long sparse time series, containing mostly zeros and some unevenly spaced non-zero observations. Original DTW distance does not take advantage of this sparsity, leading to redundant calculations and a prohibitively large computational cost for long time series. We derive a new time warping similarity measure (AWarp) for sparse time series that works on the run-length encoded representation of sparse time series. The complexity of AWarp is quadratic on the number of observations as opposed to the range of time of the time series. Therefore, AWarp can be several orders of magnitude faster than DTW on sparse time series. AWarp is exact for binary-valued time series and a close approximation of the original DTW distance for any-valued series. We discuss useful variants of AWarp: bounded (both upper and lower), constrained, and multidimensional. We show applications of AWarp to three data mining tasks including clustering, classification, and outlier detection, which are otherwise not feasible using classic DTW, while producing equivalent results. Potential areas of application include bot detection, human activity classification, and unusual review pattern mining.