Searching and mining trillions of time series subsequences under dynamic time warping
Top Cited Papers
Open Access
- 12 August 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 2012, 262-270
Abstract
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series data mining algorithms. The difficulty of scaling search to large datasets largely explains why most academic work on time series data mining has plateaued at considering a few millions of time series objects, while much of industry and science sits on billions of time series objects waiting to be explored. In this work we show that by using a combination of four novel ideas we can search and mine truly massive time series for the first time. We demonstrate the following extremely unintuitive fact; in large datasets we can exactly search under DTW much more quickly than the current state-of-the-art Euclidean distance search algorithms. We demonstrate our work on the largest set of time series experiments ever attempted. In particular, the largest dataset we consider is larger than the combined size of all of the time series datasets considered in all data mining papers ever published. We show that our ideas allow us to solve higher-level time series data mining problem such as motif discovery and clustering at scales that would otherwise be untenable. In addition to mining massive datasets, we will show that our ideas also have implications for real-time monitoring of data streams, allowing us to handle much faster arrival rates and/or use cheaper and lower powered devices than are currently possible.Keywords
This publication has 30 references indexed in Scilit:
- Embedding-based subsequence matching in time-series databasesACM Transactions on Database Systems, 2011
- Comparative and demographic analysis of orang-utan genomesNature, 2011
- A disk-aware algorithm for time series motif discoveryData Mining and Knowledge Discovery, 2010
- Finding anomalous periodic time seriesMachine Learning, 2008
- Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measuresThe VLDB Journal, 2008
- Using multiple indexes for efficient subsequence matching in time-series databasesInformation Sciences, 2007
- Scaling and time warping in time series queryingThe VLDB Journal, 2007
- High-resolution QRS fiducial point corrections in sparsely sampled ECG recordingsPhysiological Measurement, 2005
- Optimizing similarity search for arbitrary length time series queriesIEEE Transactions on Knowledge and Data Engineering, 2004
- What every computer scientist should know about floating-point arithmeticACM Computing Surveys, 1991