Dynamic Time Warping Averaging of Time Series Allows Faster and More Accurate Classification

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn 2015-January, Issue January, 2014, Pages 470-479

  Petitjean, Francois ^a   Forestier, Germain ^b   Webb, Geoffrey I ^a   Nicholson, Ann E ^a   Chen, Yanping ^c   Keogh, Eamonn ^c  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITÉ DE HAUTE ALSACE   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Dynamic Time Warping; Nearest centroid; Nearest Neighbor; Time series averaging; Time series classification

Indexed keywords

COMPUTATIONAL EFFICIENCY; TIME SERIES;

CLASSIFICATION ALGORITHM; COMPUTATIONAL RESOURCES; DYNAMIC TIME WARPING; NEAREST CENTROID; NEAREST NEIGHBOR ALGORITHM; NEAREST NEIGHBORS; RESOURCECONSTRAINED DEVICES; TIME SERIES CLASSIFICATIONS;

DATA MINING;

EID: 84936941169     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2014.27     Document Type: Conference Paper

References (35)

1. X. Wang, A. Mueen, H. Ding, G. Trajcevski, P. Scheuermann, and E. Keogh, " Experimental comparison of representation methods and distance measures for time series data," Data Mining and Knowledge Discovery, vol. 26, no. 2, pp. 275-309, 2013.
2. A. Bagnall and J. Lines, " An experimental evaluation of nearest neighbour time series classification. technical report #CMP-C14-01," Department of Computing Sciences, University of East Anglia, Tech. Rep., 2014.
3. X. Xi, E. Keogh, C. Shelton, L. Wei, and C. A. Ratanamahatana, " Fast time series classification using numerosity reduction," in Int. Conf. on Machine Learning, 2006, pp. 1033-1040.
4. T. Rakthanmanon, B. Campana, A. Mueen, G. Batista, B. Westover, Q. Zhu, J. Zakaria, and E. Keogh, " Searching and mining trillions of time series subsequences under dynamic time warping, " in Int. Conf. on Knowledge Discovery and Data Mining, 2012, pp. 262-270.
5. I. Assent, M. Wichterich, R. Krieger, H. Kremer, and T. Seidl, " Anticipatory DTW for efficient similarity search in time series databases," Proceedings of the VLDB Endowment, vol. 2, no. 1, pp. 826-837, 2009.
6. H. Kremer, S. Günnemann, A.-M. Ivanescu, I. Assent, and T. Seidl, " Efficient processing of multiple DTW queries in time series databases," in Scientific and Statistical Database Management. Springer, 2011, pp. 150-167.
7. D. E. Zhuang, G. C. Li, and A. K. Wong, " Discovery of temporal associations in multivariate time series," IEEE Transactions on Knowledge and Data Engineering, 2014.
8. F. Petitjean, A. Ketterlin, and P. Gançarski, " A global averaging method for dynamic time warping, with applications to clustering," Pattern Recognition, vol. 44, no. 3, pp. 678-693, 2011.
9. F. Galton, "Vox populi, " Nature, vol. 75, no. 1949, pp. 450-451, 1907.
10. R. Tibshirani, T. Hastie, B. Narasimhan, and G. Chu, " Diagnosis of multiple cancer types by shrunken centroids of gene expression," National Academy of Sciences, vol. 99, no. 10, pp. 6567-6572, 2002.
11. J. Gou, Z. Yi, L. Du, and T. Xiong, "A local mean-based k-nearest centroid neighbor classifier, " The Computer Journal, vol. 55, no. 9, pp.1058-1071, 2012.
12. D. Ariely, "Seeing sets: Representation by statistical properties, " Psychological Science, vol. 12, no. 2, pp. 157-162, 2001.
13. G. A. Alvarez, " Representing multiple objects as an ensemble enhances visual cognition," Trends in cognitive sciences, vol. 15, no. 3, pp. 122-131, 2011.
14. R. Jenkins,A. Burton 100% accuracy in automatic face recognition Science 319, 5862, 435-435, 2008.
15. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, January 1997, ch. 14 Multiple String Comparison-The Holy Grail, pp. 332-367.
16. L. Wang and T. Jiang, "On the complexity of multiple sequence alignment, " Journal of Computational Biology, vol. 1, no. 4, pp. 337-348, 1994.
17. L. Gupta, D. L. Molfese, R. Tammana, and P. G. Simos, " Nonlinear alignment and averaging for estimating the evoked potential," IEEE Transactions on Biomedical Engineering, vol. 43, no. 4, pp. 348-356, 1996.
18. K. Wang, T. Gasser et al., "Alignment of curves by dynamic time warping, " The Annals of Statistics, vol. 25, no. 3, pp. 1251-1276, 1997.
19. V. Niennattrakul and C. A. Ratanamahatana, "Shape averaging under time warping, " in Int. Conf. on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, IEEE, vol. 2, 2009, pp. 626-629.
20. S. Ongwattanakul and D. Srisai, " Contrast enhanced dynamic time warping distance for time series shape averaging classification," in Int. Conf. on Interaction Sciences: Information Technology, Culture and Human, ACM, 2009, pp. 976-981.
21. D.-F. Feng and R. F. Doolittle, "Progressive sequence alignment as a prerequisitetto correc t phylogenetic trees," Journal of Molecular Evolution, vol. 25, no. 4, pp. 351-360, 1987.
22. E. Keogh, X. Xi, L. Wei, and C. A. Ratanamahatana, "The UCR time series classification/clusteri ng homepage," http://www.cs.ucr.edu/~eamonn/time-series-data/, 2011.
23. F. Petitjean, "Matlab and java source code for DBA, " doi:10.5281/zenodo.10432, 2014.
24. P. Kranen and T. Seidl, "Harnessing the strengths of anytime algorithms for constant data streams, " Data Mining and Knowledge Discovery, vol. 19, no. 2, pp. 245-260, 2009.
25. B. Hu, T. Rakthanmanon, Y. Hao, S. Evans, S. Lonardi, and E. Keogh, " Discovering the intrinsic cardinality and dimensionality of time series using mdl," in Int. Conf. on Data Mining, IEEE, 2011, pp. 1086-1091.
26. C. A. Ratanam ahatana and E. Keogh, " Three myths about dynamic time warping data mining," in SIAM Int. Conf. on Data Mining, 2005, pp. 506-510.
27. F. Petitjean and P. Gançarski, " Summarizing a set of time series by averaging: From steiner sequence to compact multiple alignment," Theoretical Computer Science, vol. 414, no. 1, pp. 76-91, 2012.
28. V. Niennattrakul and C. A. Ratanamahatana, " Inaccuracies of shape averaging method using dynamic time warping for time series data," in Int. Conf. on Computational Science. Springer, 2007, pp. 513-520.
29. E. Pekalska, R. P. Duin, and P. Pacl ík, " Prototype selection for dissimilarity-based classifiers," Pattern Recognition, vol. 39, no. 2, pp. 189-208, 2006.
30. K. Ueno, X. Xi, E. Keogh, and D.-J. Lee, "Anytime clas sification using the nearest neighbor algorithm with applications to stream mining," in Int. Conf. on Data Mining, IEEE, 2006, pp. 623-632.
31. Y. Chen, A. Why, G. Batista, A. Mafra-Neto, and E. Keogh, " Flying insect classification with inexpensive sensors," Journal of Insect Behavior, vol. 27, no. 5, pp. 657-677, 2014.
32. L. B. Goddard, A. E. Roth, W. K. Reisen, T. W. Scott et al., " Vector competence of california mosquitoes for west nile virus," Emerging infectious diseases, vol. 8, no. 12, pp. 1385-1391, 2002.
33. "Additional material, " http://www.tinyclues. eu /Research/ICDM2014-DTW/index.php.
34. J. Dem͉ar, " Statistical comparisons of classifiers over multiple data sets," The Journal of Machine Learning Research, vol. 7, pp. 1-30, 2006.
35. X. Xi,K. Ueno,E. Keogh,D.-J. Lee Converting nonparametric distance-based classification to anytime algorithms Pattern Analysis and Applications 11, 3-4, 321-336, 2008.