Sage Journals: Discover world-class research

Abstract

The dynamic time warping (DTW) distance measure is one of the popular and efficient distance measures used in algorithms of time series classification. It frequently occurs with different kinds of transformations of input data. In this paper we propose a combination of the DTW distance measure with a (discrete) integral transformation. This means that the new distance measure IDTW is simply calculated as the value of DTW on the integrated input time series. However, this design means that the distance cannot in itself give good classification results. We therefore propose to construct a parametric integral dynamic time warping distance measure ID_DTW which is a parametric combination of the distances DTW and IDTW. Such a combined distance is used in the nearest neighbor (1NN) classification method in the case of both univariate and multivariate time series analysis. Computational experiments performed on both one-dimensional and multidimensional datasets show that this approach reduces the classification error significantly in comparison with the component methods. The parametric approach allows the new distance to be adapted to each dataset, while showing no significant overfitting effects. The contribution and the main motivation of the paper is to show that the simple transformation as the integral transform can include a bit information about examined time series data and can be used to significantly improve performance of the classification process both for univariate and multivariate time series data. The results are confirmed by graphical and statistical comparisons.

Keywords

Time series classification univariate and multivariate time series data dynamic time warping parametric integral distance measure

Get full access to this article

View all access options for this article.

References

Aghabozorgi

, Shirkhorshidi

A.S.

and Wah

T.Y.

, Time-series clustering—A decade review, Information Systems53 (2015), 16–38.

Ahmad

S.S.S.

and Pedrycz

, The development of granular rule-based systems: A study in structural model compression, Granular Computing2(1) (2017), 1–12.

Bache

and Lichman

, UCIMachine Learning Repository [http://archive.ics.uci.edu/ml], University of California, School of Information and Computer Science, Irvine. CA, 2013.

Berndt

D.J.

and Clifford

, Using dynamic time warping to find patterns in time series, AAAIWorkshop on Knowledge Discovery in Databases (1994), 229–248.

Blankertz

, Curio

, Müller

K.R.

, Classifying single trial EEG: Towards brain computer interfacing, http://www.bbci.de/competition/ii/, In: Diettrich

T.G.

, Becker

and Ghahramani

(Eds.), Advances in Neural Inf.roc. Systems 14 (NIPS 01). Available from, 2002.

Box

G.E.P.

, Jenkins

G.M.

and Reinsel

G.C.

, Time series analysis: Forecasting and control, Wiley, 2008.

Chen

, Keogh

, Hu

, Begum

, Bagnall

, Mueen

and Batista

, The UCR Time Series Classification Archive. www.cs.ucr.edu/∼eamonn/time_series_data/ (2015).

Chen

M.Y.

and Chen

B.T.

, A hybrid fuzzy time series model based on granular computing for stock price forecasting, Information Sciences294 (2015), 227–241.

Chen

M.Y.

and Chen

B.T.

, Online fuzzy time series analysis based on entropy discretization and a fast fourier transform, Applied Soft Computing14 (2014), 156–166.

10.

Chen

M.Y.

, A high-order fuzzy time series forecasting model for Internet stock trading, Future Generation Computer Systems - The International Journal of eScience37 (2014), 461–467.

11.

Carnegie Mellon University Motion Capture Database (2014). Available from: http://mocap.cs.cmu.edu/.

12.

Demšar

, Statistical Comparisons of Classifiers over Multiple Data Sets, Journal of Machine Learning Research7 (2006), 1–30.

13.

Ding

, Trajcevski

, Scheuermann

, Wang

and Keogh

, Querying and Mining of Time Series Data: Experimental Comparison of Representations and Distance Measures, In Proc 34th Int Conf on Very Large Data Bases, 2008, pp. 1542–1552.

14.

Górecki

and Łuczak

, Using derivatives in time series classification, Data Mining and Knowledge Discovery26(2) (2013), 310–331.

15.

Górecki

and Łuczak

, First and second derivative in time series classification using DTW, Communications in Statistics-Simulation and Computation43(9) (2014a), 2081–2092.

16.

Górecki

and Łuczak

, Non-isometric transforms in time series classification using DTW, Knowledge-Based Systems61 (2014b), 98–108.

17.

Górecki

and Łuczak

, Multivariate time series classification with parametric derivative dynamic time warping, Expert Systems with Applications42(5) (2015), 2305–2312.

18.

Keogh

, Exact indexing of dynamic time warping, In 28th International Conference on Very Large Data Bases, 2002, pp. 406–417.

19.

Keogh

and Kasetty

, On the need for time series data mining benchmarks: A survey and empirical demonstration, Data Mining and Knowledge Discovery4(7) (2003), 349–371.

20.

Keogh

and Pazzani

, Dynamic Time Warping with Higher Order Features, In First SIAM International Conference on Data Mining (SDM’2001), Chicago, USA, 2001.

21.

Leeb

, Lee

, Keinrath

, Scherer

, Bischof

and Pfurtscheller

, Brain-computer communication: Motivation, aim, and impact of exploring a virtual apartment, http://www.bbci.de/competition/iv/, IEEE Transactions on Neural Systems and Rehabilitation Engineering15, 473–482. Available from, 2007.

22.

Lemire

, Faster retrieval with a two-pass dynamic-time-warping lower bound, Pattern Recognition42(9) (2009), 2169–2180.

23.

Liu

, Gegov

and Cocea

, Rule-based systems: A granular computing perspective, Granular Computing1(4) (2016), 259–274.

24.

Łuczak

, Hierarchical clustering of time series data with parametric derivative dynamic time warping, Expert Systems with Applications62 (2016), 116–130.

25.

Olszewski

R.T.

, Generalized Feature Extraction for Structural Pattern Recognition in Time-Series Data, http://www.cs.cmu.edu/ bobski, Ph. D. Thesis. Carnegie Mellon University, Pittsburgh. Available from, 2001.

26.

Peters

and Weber

, DCC: A framework for dynamic granular clustering, Granular Computing1(1) (2016), 1–11.

27.

Petitjean

, Forestier

, Webb

G.I.

, Nicholson

A.E.

, Chen

and Keogh

, Faster and more accurate classification of time series by exploiting a novel dynamic time warping averaging algorithm, Knowledge and Information Systems47(1) (2016), 1–26.

28.

Shokoohi-Yekta

, Wang

and Keogh

, On the Non-Trivial Generalization of Dynamic Time Warping to the Multi-Dimensional Case, Proceedings of the 2015 SIAM International Conference on Data Mining, 2015, p. 9.

29.

Skowron

, Jankowski

and Dutta

, Interactive granular computing, Granular Computing1(2) (2016), 95–113.

30.

Taylor

, Zhou

, Rouphail

N.M.

and Porter

R.J.

, Method for investigating intradriver heterogeneity using vehicle trajectory data: A Dynamic Time Warping approach, Transportation Research Part B: Methodological73 (2015), 59–80.

31.

Warrenliao

, Clustering of time series data— a survey, Pattern Recognition38(11) (2005), 1857–1874.

32.

Xing

, Pei

and Keogh

, A brief survey on sequence classification, ACM SIGKDD Explorations Newsletter12(1) (2010), 40–48.

33.

Yao

, A triarchic theory of granular computing, Granular Computing1(2) (2016), 145–157.