DTW+S: Shape-based Comparison of Time-series with Ordered Local Trend
Measuring distance or similarity between time-series data is a fundamental aspect of many applications including classification, clustering, and ensembling/alignment. Existing measures may fail to capture similarities among local trends (shapes) and may even produce misleading results. Our goal is to develop a measure that looks for similar trends occurring around similar times and is easily interpretable for researchers in applied domains. This is particularly useful for applications where time-series have a sequence of meaningful local trends that are ordered, such as in epidemics (a surge to an increase to a peak to a decrease). We propose a novel measure, DTW+S, which creates an interpretable "closeness-preserving" matrix representation of the time-series, where each column represents local trends, and then it applies Dynamic Time Warping to compute distances between these matrices. We present a theoretical analysis that supports the choice of this representation. We demonstrate the utility of DTW+S in several tasks. For the clustering of epidemic curves, we show that DTW+S is the only measure able to produce good clustering compared to the baselines. For ensemble building, we propose a combination of DTW+S and barycenter averaging that results in the best preservation of characteristics of the underlying trajectories. We also demonstrate that our approach results in better classification compared to Dynamic Time Warping for a class of datasets, particularly when local trends rather than scale play a decisive role.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDynamic Time WarpingTime SeriesMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
The DOPE Distance is SIC: A Stable, Informative, and Computable Metric on Time Series And Ordered Merge Trees
Metrics for merge trees that are simultaneously stable, informative, and efficiently computable have so far eluded researchers. We show in this work that it is possible to devise such a metric when restricting merge tree…
Dynamic Time WarpingTime SeriesTime Series AnalysisTime Series ClassificationRecurrent Slice Networks for 3D Segmentation of Point Clouds
Point clouds are an efficient data format for 3D data. However, existing 3D segmentation methods for point clouds either do not model local dependencies \cite{pointnet} or require added computations \cite{kd-net,pointnet…
Semantic SegmentationBenchmarking Multivariate Time Series Classification Algorithms
Time Series Classification (TSC) involved building predictive models for a discrete target variable from ordered, real valued, attributes. Over recent years, a new set of TSC algorithms have been developed which have mad…
BenchmarkingClassificationDynamic Time WarpingGeneral Classification+3Ultra-Fast Shapelets for Time Series Classification
Time series shapelets are discriminative subsequences and their similarity to a time series can be used for time series classification. Since the discovery of time series shapelets is costly in terms of time, the applica…
ClassificationGeneral ClassificationTime SeriesTime Series Analysis+1SE-shapelets: Semi-supervised Clustering of Time Series Using Representative Shapelets
Shapelets that discriminate time series using local features (subsequences) are promising for time series clustering. Existing time series clustering methods may fail to capture representative shapelets because they disc…
ClusteringTime SeriesTime Series Clustering