Abstract
Over recent years the popularity of time series has soared. Given the widespread use of modern information technology, a large number of time series may be collected during business, medical or biological operations, for example. As a consequence there has been a dramatic increase in the amount of interest in querying and mining such data, which in turn has resulted in a large number of works introducing new methodologies for indexing, classification, clustering and approximation of time series. In particular, many new distance measures between time series have been introduced. In this paper, we propose a new distance function based on a derivative. In contrast to well-known measures from the literature, our approach considers the general shape of a time series rather than point-to-point function comparison. The new distance is used in classification with the nearest neighbor rule. In order to provide a comprehensive comparison, we conducted a set of experiments, testing effectiveness on 20 time series datasets from a wide variety of application domains. Our experiments show that our method provides a higher quality of classification on most of the examined datasets.
Article PDF
Similar content being viewed by others
Explore related subjects
Find the latest articles, discoveries, and news in related topics.Avoid common mistakes on your manuscript.
References
Batista G, Wang X, Keogh E (2011) A complexity-invariant distance measure for time series. In: Eleventh SIAM international conference on data mining (SDM’2011), Mesa, USA
Benedikt L, Cosker D, Rosin PL, Marshal D (2008) Facial dynamics in biometric identification. In: BMVC, vol 2, pp 235– 241
Benedikt L, Cosker D, Rosin PL, Marshal D (2010) Assessing the uniqueness and permanence of facial actions for use in biometric applications. IEEE Trans Syst Man Cybernet A Syst Humans 40(3): 449–460
Berndt DJ, Clifford J (1994) Using dynamic time warping to find patterns in time series. In: AAAI workshop on knowledge discovery in databases, pp 229–248
Box GEP, Jenkins GM, Reinsel GC (2008) Time series analysis: forecasting and control. Wiley, New York
Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7: 1–30
Ding H, Trajcevski G, Scheuermann P, Wang X, Keogh E (2008) Querying and mining of time series data: experimental comparison of representations and distance measures. In: Proceedings of 34th international conference on very large data bases, pp 1542–1552
Dunn OJ (1961) Multiple comparisons among means. J Am Stat Assoc 56: 52–64
Eads D, Hill D, Davis S, Perkins S, Ma J, Porter R, Theiler J (2002) Genetic algorithms and support vector machines for time series classification. In: Proc Int Soc Optic Eng 4787: 74–85
Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32: 675–701
Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11: 86–92
Gullo F, Ponti F, Tagarelli A, Greco S (2009) A time series representation model for accurate and fast similarity detection. Pattern Recogn 42(11): 2998–3014
Hollander M, Wolfe DA (1973) Nonparametric statistical methods. Wiley, New York
Iman RL, Davenport JM (1980) Approximations of the critical region of the Freidman statistic. Commun Stat Theory Methods 9: 571–595
Keogh E (2002) Exact indexing of dynamic time warping. In 28th International Conference on Very Large Data Bases 406-417
Keogh E, Kasetty E (2003) On the need for time series data mining benchmarks: a survey and empirical demonstration. Data Min Knowl Discov 7(4): 349–371
Keogh E, Pazzani M (2001) Dynamic time warping with higher order features. In: Proceedings of SIAM international conference on data mining (SDM’2001), Chicago, USA
Keogh E, Xi X, Wei L, Ratanamahatana CA (2006) The UCR Time Series Classification/Clustering Homepage: http://www.cs.ucr.edu/~eamonn/time_series_data/
Kulbacki M, Segen J, Bak A (2002) Unsupervised learning motion models using dynamic time warping. In: Proceedings of the intelligent information systems 2002 symposium, Sopot, 2002
Looney SW (1998) A statistical technique for comparing the accuracies of several classifiers. Pattern Recogn Lett 8: 5–9
Luan F, Li K, Ma S (2010) The algorithm of online handwritten signature verification based on improved DTW. Int J Model Identif Control 10(1-2): 81–86
Mokhtar N, Arof H, Iwahashi M (2010) One dimensional image processing for eye tracking using derivative dynamic time warping. Sci Res Essays 5(19): 2947–2952
Nemenyi PB (1963) Distribution-free multiple comparisons. PhD thesis, Princeton University
Pavlovic V, Frey BJ, Huang TS (1999) Time-series classification using mixed-state dynamic Bayesian networks. In: Proceedings of IEEE conference on computer vision and pattern recognition, vol 2, pp 2609–2615
Penny W, Roberts S (1999) Dynamic models for nonstationary signal segmentation. Comput Biomed Res 32(6): 483–502
Petridis V, Kehagias A (1997) Predictive modular neural networks for time series classification. Neural Netw 10(1): 31–49
Open Access
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
Responsible editor: Eamonn Keogh.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Górecki, T., Łuczak, M. Using derivatives in time series classification. Data Min Knowl Disc 26, 310–331 (2013). https://doi.org/10.1007/s10618-012-0251-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10618-012-0251-4